LEADER 03352nam 2200601 450 001 9910818824803321 005 20220824065406.0 010 $a0-8218-7655-4 010 $a0-8218-5052-0 035 $a(CKB)3240000000069593 035 $a(EBL)3112923 035 $a(SSID)ssj0001053414 035 $a(PQKBManifestationID)11606394 035 $a(PQKBTitleCode)TC0001053414 035 $a(PQKBWorkID)11114228 035 $a(PQKB)11573150 035 $a(MiAaPQ)EBC3112923 035 $a(WaSeSS)Ind00039245 035 $a(RPAM)2880002 035 $a(PPN)197103855 035 $a(EXLCZ)993240000000069593 100 $a19870108h19871987 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aLogic and combinatorics $eproceedings of the AMS-IMS-SIAM Joint Summer Research Conference held August 4-10, 1985 /$fStephen G. Simpson, editor 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[1987] 210 4$dİ1987 215 $a1 online resource (408 p.) 225 1 $aContemporary mathematics,$x0271-4132 ;$v65$x0271-4132 300 $aDescription based upon print version of record. 320 $aIncludes bibliographies. 327 $aTable 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. 410 0$aContemporary mathematics (American Mathematical Society).$v65$x0271-4132 606 $aLogic, Symbolic and mathematical$vCongresses 606 $aCombinatorial analysis$vCongresses 615 0$aLogic, Symbolic and mathematical 615 0$aCombinatorial analysis 676 $a511.3 702 $aSimpson$b Stephen G$g(Stephen George),$f1945- 712 02$aAmerican Mathematical Society, 712 02$aInstitute of Mathematical Statistics, 712 02$aSociety for Industrial and Applied Mathematics, 712 12$aAMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Applications of Mathematical Logic to Finite Combinatorics 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910818824803321 996 $aLogic and combinatorics$91427588 997 $aUNINA