Recursively saturated models generated by indiscernibles

DOI10.1305/ndjfl/1093870818zbMath0487.03018OpenAlexW2068579740MaRDI QIDQ1165236

James H. Schmerl

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/1093870818

zbMATH Keywords

countable recursively saturated model of Peano arithmetic

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Model theory of denumerable and separable structures (03C15)

Related Items (7)

European Summer Meeting of the Association for Symbolic Logic ⋮ Automorphisms of models of arithmetic: a unified view ⋮ Automorphisms of countable recursively saturated models of PA: A survey ⋮ Automorphisms of recursively saturated models of arithmetic ⋮ Modèles saturés et modèles engendrés par des indiscernables ⋮ Largest initial segments pointwise fixed by automorphisms of models of set theory ⋮ Real closed fields and models of Peano arithmetic

This page was built for publication: Recursively saturated models generated by indiscernibles