The Recursively Saturated Part of Models of Peano Arithmetic

DOI10.1002/MALQ.19860321910MaRDI QIDQ3758814zbMATH OpenOpenAlexFDO

Authors Henryk Kotlarski

Publication date 1986

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19860321910

zbMATH Keywords

models of arithmeticrecursive saturation

Mathematics Subject Classification ID

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

Recommendations

• On M-recursively saturated models of arithmetic
• scientific article; zbMATH DE number 32280
• scientific article; zbMATH DE number 7183906
• Remarks on weak notions of saturation in models of Peano arithmetic
• On elementary cuts in recursively saturated models of Peano Arithmetic

Cited in

(6)

• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• Recursively saturated nonstandard models of arithmetic; addendum
• Models with the ω-property
• Model-theoretic properties characterizing Peano arithmetic
• A Note on Real Subsets of A Recursively Saturated Model
• On M-recursively saturated models of arithmetic

This page was built for publication: The Recursively Saturated Part of Models of Peano Arithmetic

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