Logic and combinatorics : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference held August 4-10, 1985

Logic, Symbolic and mathematical Combinatorial analysis
American Mathematical Society
1987
EISBN 0821876554
Table of Contents.
Preface.
Dilators, Generalized Goodstein Sequences, Independence Results: A Survey.
Some Uses of Dilators in Combinatorial Problems, Part I.
Cross Products of Souslin Trees.
Ergodic Ramsey Theory.
Ultrafilters Related to Hindman's Finite Unions Theorem and its Extensions.
Logical Analysis of Some Theorems of Combinatorics and Topological Dynamics.
A Remark on Partition Relations for Infinite Ordinals, With an Application to Finite Combinatorics.
A Summary of On Ramsey-type Theorems and Their Provability in Weak Formal Systems.
Provably Computable Functions and the Fast Growing Hierarcy.
Rigid Borel Sets and Better Quasiorder Theory.
Some Problems on Finite and Infinite Graphs.
The Metamathematics of the Graph Minor Theorem.
Summable Ultrafilters and Finite Sums.
On Undecidability of the Weakened Kruskal Theorem.
Well Quasi Orderings, Long Games, and a Combinatorial Study of Undecidability.
On the Theory of Quasi Ordinal Diagrams.
Improved Bounds to the Length of Proofs of Finitistic Consistency Statements.
Non Standard Universes with Strong Embeddings, and Their Finite Approximations.
Unprovable Theorems and Fast-Growing Functions.
Preface.
Dilators, Generalized Goodstein Sequences, Independence Results: A Survey.
Some Uses of Dilators in Combinatorial Problems, Part I.
Cross Products of Souslin Trees.
Ergodic Ramsey Theory.
Ultrafilters Related to Hindman's Finite Unions Theorem and its Extensions.
Logical Analysis of Some Theorems of Combinatorics and Topological Dynamics.
A Remark on Partition Relations for Infinite Ordinals, With an Application to Finite Combinatorics.
A Summary of On Ramsey-type Theorems and Their Provability in Weak Formal Systems.
Provably Computable Functions and the Fast Growing Hierarcy.
Rigid Borel Sets and Better Quasiorder Theory.
Some Problems on Finite and Infinite Graphs.
The Metamathematics of the Graph Minor Theorem.
Summable Ultrafilters and Finite Sums.
On Undecidability of the Weakened Kruskal Theorem.
Well Quasi Orderings, Long Games, and a Combinatorial Study of Undecidability.
On the Theory of Quasi Ordinal Diagrams.
Improved Bounds to the Length of Proofs of Finitistic Consistency Statements.
Non Standard Universes with Strong Embeddings, and Their Finite Approximations.
Unprovable Theorems and Fast-Growing Functions.
