Atomic saturation of reduced powers

Mathematical Logic Quarterly 67 (1):18-42 (2021)
  Copy   BIBTEX

Abstract

Our aim was to try to generalize some theorems about the saturation of ultrapowers to reduced powers. Naturally, we deal with saturation for types consisting of atomic formulas. We succeed to generalize “the theory of dense linear order (or T with the strict order property) is maximal and so is any which is SOP3”, (where Δ consists of atomic or conjunction of atomic formulas). However, the theorem on “it is enough to deal with symmetric pre‐cuts” (so the theorem) cannot be generalized in this case. Similarly the uniqueness of the dual cofinality fails in this context.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2021-05-22

Downloads
7 (#603,698)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Keisler’s order via Boolean ultrapowers.Francesco Parente - 2020 - Archive for Mathematical Logic 60 (3):425-439.

Add more citations

References found in this work

Toward classifying unstable theories.Saharon Shelah - 1996 - Annals of Pure and Applied Logic 80 (3):229-255.
On ◁∗-maximality.Mirna Džamonja & Saharon Shelah - 2004 - Annals of Pure and Applied Logic 125 (1-3):119-158.
Ultraproducts which are not saturated.H. Jerome Keisler - 1967 - Journal of Symbolic Logic 32 (1):23-46.
More on SOP 1 and SOP 2.Saharon Shelah & Alexander Usvyatsov - 2008 - Annals of Pure and Applied Logic 155 (1):16-31.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.

View all 11 references / Add more references