scientific article; zbMATH DE number 3946114

MaRDI QIDQ3717036zbMATH OpenFDO

Authors Kenneth McAloon

Publication date 1985

zbMATH Keywords

Finite Ramsey theoremsmodels of arithmeticpartition properties involving ordinalsproof theory

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) First-order arithmetic and fragments (03F30)

Recommendations

• An Unprovable Ramsey-Type Theorem
• Independence of Ramsey theorem variants using \(\varepsilon _0\)
• scientific article; zbMATH DE number 4059394
• scientific article; zbMATH DE number 3928990
• On Gödel incompleteness and finite combinatorics

Cited in

(14)

• On Fraïssé's conjecture for linear orders of finite Hausdorff rank
• The strength of infinitary Ramseyan principles can be accessed by their densities
• Independence of Ramsey theorem variants using \(\varepsilon _0\)
• The strength of Ramsey's theorem for coloring relatively large sets
• scientific article; zbMATH DE number 3878922 (Why is no real title available?)
• scientific article; zbMATH DE number 3928990 (Why is no real title available?)
• An Unprovable Ramsey-Type Theorem
• Conservativity of ultrafilters over subsystems of second order arithmetic
• The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem
• On incompleteness in mathematics and the Paris-Harrington principle
• Mathematical Incompleteness Results in First-Order Peano Arithmetic: A Revisionist View of the Early History
• Higman's lemma is stronger for better quasi orders
• Subsystems of true arithmetic and hierarchies of functions
• Reductions of well-ordering principles to combinatorial theorems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3717036)