On the role of Ramsey quantifiers in first order arithmetic

DOI10.2307/2273152MaRDI QIDQ3953757zbMATH OpenOpenAlexFDO

Authors James H. Schmerl, Stephen G. Simpson

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

Girard hierarchyGrzegorczyk-Wainer hierarchyPeano arithmeticPresburger arithmeticproof-theoretic ordinalstrong completenessstrong model

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(7)

• 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

This page was built for publication: On the role of Ramsey quantifiers in first order arithmetic

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