Subsets coded in elementary end extensions

DOI10.1007/S00153-014-0381-ZzbMATH Open1298.03099OpenAlexW2036922272MaRDI QIDQ403405FDOQ403405

Authors: 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

Recommendations

• Subsets of models of arithmetic
• On two problems concerning end extensions
• Minimal elementary end extensions
• End extensions of models of arithmetic
• Extendible Sets in Peano Arithmetic

zbMATH Keywords

coded setsend extensionMacDowell-Specker theorem

Mathematics Subject Classification ID

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

Cites Work

• Subsystems of second order arithmetic
• On the strength of Ramsey's theorem for pairs
• Title not available (Why is that?)
• Subsets of models of arithmetic
• Formalizing forcing arguments in subsystems of second-order arithmetic
• Title not available (Why is that?)
• Corrigendum to: ``On the strength of Ramsey's theorem for pairs
• Title not available (Why is that?)
• On maximum conservative extensions
• Title not available (Why is that?)
• The structure of models of Peano arithmetic
• A note on a theorem of Kanovei

Cited In (4)

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

This page was built for publication: Subsets coded in elementary end extensions

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