On the role of Ramsey quantifiers in first order arithmetic

DOI10.2307/2273152zbMath0492.03015OpenAlexW2011178105MaRDI 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 arithmeticstrong completenessPresburger arithmeticproof-theoretic ordinalstrong modelGirard hierarchyGrzegorczyk-Wainer hierarchy

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Logic with extra quantifiers and operators (03C80) Models of arithmetic and set theory (03C62) Quantifier elimination, model completeness, and related topics (03C10)

Related Items

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

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)