scientific article

zbMath0589.03028MaRDI QIDQ3717036

Kenneth McAloon

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

proof theorymodels of arithmeticFinite Ramsey theoremspartition properties involving ordinals

Mathematics Subject Classification ID

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

Related Items

The strength of infinitary Ramseyan principles can be accessed by their densities ⋮ THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS ⋮ CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC ⋮ The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ On Fraïssé's conjecture for linear orders of finite Hausdorff rank