Elementary extensions of recursively saturated models of arithmetic

DOI10.1305/NDJFL/1093883454MaRDI QIDQ1173087zbMATH OpenOpenAlexFDO

Authors Craig Smoryński

Publication date 1981

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093883454

zbMATH Keywords

end extensionsrecursively saturatedrecursively saturated structurescofinal extensioncountable nonstandard models of arithmetic

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Second- and higher-order arithmetic and fragments (03F35) Nonstandard models of arithmetic (03H15)

Cited in

(4)

• Elementary cuts in saturated models of Peano arithmetic
• On cofinal submodels and elementary interstices
• Four problems concerning recursively saturated models of arithmetic
• Truth in generic cuts

This page was built for publication: Elementary extensions of recursively saturated models of arithmetic

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