Iterated ultrapowers for the masses

, &
Archive for Mathematical Logic 57 (5-6):557-576 (2018)
  Copy   BIBTEX

Abstract

We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown to provide smooth proofs of several results in general model theory.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-017-0592-1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
Iterated extended ultrapowers and supercompactness without choice.Mitchell Spector - 1991 - Annals of Pure and Applied Logic 54 (2):179-194.
Some applications of iterated ultrapowers in set theory.Kenneth Kunen - 1970 - Annals of Mathematical Logic 1 (2):179.
Ultrapowers without the axiom of choice.Mitchell Spector - 1988 - Journal of Symbolic Logic 53 (4):1208-1219.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
Iterated ultrapowers and Prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109.
Δ1 Ultrapowers are totally rigid.T. G. McLaughlin - 2007 - Archive for Mathematical Logic 46 (5-6):379-384.
Representation of MV-algebras by regular ultrapowers of [0, 1].Antonio Di Nola, Giacomo Lenzi & Luca Spada - 2010 - Archive for Mathematical Logic 49 (4):491-500.
Multiple and iterated contraction reduced to single-step single-sentence contraction.Sven Ove Hansson - 2010 - Synthese 173 (2):153-177.
Game sentences and ultrapowers.Renling Jin & H. Jerome Keisler - 1993 - Annals of Pure and Applied Logic 60 (3):261-274.
Three Approaches to Iterated Belief Contraction.Raghav Ramachandran, Abhaya C. Nayak & Mehmet A. Orgun - 2012 - Journal of Philosophical Logic 41 (1):115-142.
Iterated local reflection versus iterated consistency.Lev Beklemishev - 1995 - Annals of Pure and Applied Logic 75 (1-2):25-48.
Model theory under the axiom of determinateness.Mitchell Spector - 1985 - Journal of Symbolic Logic 50 (3):773-780.
The Measurement of Ranks and the Laws of Iterated Contraction.Wolfgang Spohn & Matthias Hild - 2008 - Artificial Intelligence 172 (10):1195-1218.
Menas' conjecture and generic ultrapowers.Yo Matsubara - 1987 - Annals of Pure and Applied Logic 36:225-234.

Analytics

Added to PP
2017-10-05

Downloads
19 (#753,814)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Rank-initial embeddings of non-standard models of set theory.Paul Kindvall Gorbow - 2020 - Archive for Mathematical Logic 59 (5-6):517-563.
Iterated ultrapowers for the masses.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (5-6):557-576.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Set Theory.T. Jech - 2005 - Bulletin of Symbolic Logic 11 (2):243-245.
Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

View all 18 references / Add more references