Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem

DOI10.1007/978-3-642-03073-4_32zbMath1268.03081OpenAlexW1566013923MaRDI QIDQ3576063

Gyesik Lee

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_32

zbMATH Keywords

independencePeano arithmeticParis-Harrington theoremKanamori-McAloon principle

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Gödel incompleteness and finite combinatorics
• Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• An Unprovable Ramsey-Type Theorem
• A classification of rapidly growing Ramsey functions
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• Combinatorial Theorems on Classifications of Subsets of a Given Set

This page was built for publication: Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem