Recursively saturated \(\omega _ 1\)-like models of arithmetic

DOI10.1305/ndjfl/1093870932zbMath0552.03021OpenAlexW2007336308MaRDI QIDQ800912

Roman Kossak

Publication date: 1985

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

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

zbMATH Keywords

isomorphism typesend extensionsfinitely determinate structuresrecursively saturated models of PA

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62)

Related Items (3)

Incomparable ω₁‐like models of set theory ⋮ Automorphisms of recursively saturated models of arithmetic ⋮ Models with the ω-property

This page was built for publication: Recursively saturated \(\omega _ 1\)-like models of arithmetic