On the role of Ramsey quantifiers in first order arithmetic

DOI10.2307/2273152zbMath0492.03015MaRDI QIDQ3953757

Stephen G. Simpson, James H. Schmerl

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273152

zbMATH Keywords

Peano arithmetic; strong completeness; Presburger arithmetic; proof-theoretic ordinal; strong model; Girard hierarchy; Grzegorczyk-Wainer hierarchy

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03F30: First-order arithmetic and fragments

03C80: Logic with extra quantifiers and operators

03C62: Models of arithmetic and set theory

03C10: Quantifier elimination, model completeness, and related topics

Related Items

A dual form of Ramsey's theorem, Countable algebra and set existence axioms, The Galvin-Prikry theorem and set existence axioms, \(\text{PA} (aa)\), Peano Arithmetic and Hyper-Ramsey Logic, Set theory with a filter quantifier, Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees

Cites Work

• Ramsey quantifiers and the finite cover property
• Consistency proofs of subsystems of classical analysis
• Peano models with many generic classes
• Substructure lattices of models of arithmetic
• A degree-theoretic definition of the ramified analytical hierarchy
• Compact extensions of L(Q) (part 1a)