| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910818824803321 |
|
|
Titolo |
Logic and combinatorics : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference held August 4-10, 1985 / / Stephen G. Simpson, editor |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Providence, Rhode Island : , : American Mathematical Society, , [1987] |
|
©1987 |
|
|
|
|
|
|
|
|
|
ISBN |
|
0-8218-7655-4 |
0-8218-5052-0 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (408 p.) |
|
|
|
|
|
|
Collana |
|
Contemporary mathematics, , 0271-4132 ; ; 65 , 0271-4132 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Logic, Symbolic and mathematical |
Combinatorial analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
| |