Saturated Models for the Working Model Theorist

&
Bulletin of Symbolic Logic 29 (2):163-169 (2023)
  Copy   BIBTEX

Abstract

We put in print a classical result that states that for most purposes, there is no harm in assuming the existence of saturated models in model theory. The presentation is aimed for model theorists with only basic knowledge of axiomatic set theory.

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2023.6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Equality-free saturated models.P. Dellunde - 2003 - Reports on Mathematical Logic:3-22.
Saturated models in institutions.Răzvan Diaconescu & Marius Petria - 2010 - Archive for Mathematical Logic 49 (6):693-723.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Closed Normal Subgroups of the Automorphism Group of a Saturated Model of Peano Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2016 - Notre Dame Journal of Formal Logic 57 (1):127-139.
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
An omitting types theorem for saturated structures.A. D. Greif & M. C. Laskowski - 1993 - Annals of Pure and Applied Logic 62 (2):113-118.
On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
A generalization of the Keisler-Morley theorem to recursively saturated ordered structures.Shahram Mohsenipour - 2007 - Mathematical Logic Quarterly 53 (3):289-294.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
A Galois correspondence for countable short recursively saturated models of PA.Erez Shochat - 2010 - Mathematical Logic Quarterly 56 (3):228-238.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Modèles saturés et modèles engendrés Par Des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.

Analytics

Added to PP
2023-02-18

Downloads
4 (#1,628,730)

6 months
2 (#1,206,195)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references