Subsets coded in elementary end extensions

DOI10.1007/s00153-014-0381-zzbMath1298.03099OpenAlexW2036922272MaRDI QIDQ403405

James H. Schmerl

Publication date: 29 August 2014

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-014-0381-z

zbMATH Keywords

end extensioncoded setsMacDowell-Specker theorem

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62)

Related Items

Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Minimal elementary end extensions ⋮ Neutrally expandable models of arithmetic

Cites Work

• A note on a theorem of Kanovei
• Subsets of models of arithmetic
• Formalizing forcing arguments in subsystems of second-order arithmetic
• On the strength of Ramsey's theorem for pairs
• Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
• On maximum conservative extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item