Minimal elementary extensions of models of set theory and arithmetic

Archive for Mathematical Logic 30 (3):181-192 (1990)
  Copy   BIBTEX

Abstract

TheoremEvery model of ZFChas a conservative elementary extension which possesses a cofinal minimal elementary extension.An application of Boolean ultrapowers to models of full arithmetic is also presented

Categories

Keywords

Reprint years

DOI

10.1007/bf01621470

Links

PhilArchive



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

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

Cofinal elementary extensions.James H. Schmerl - 2014 - Mathematical Logic Quarterly 60 (1-2):12-20.
Substructure lattices and almost minimal end extensions of models of Peano arithmetic.James H. Schmerl - 2004 - Mathematical Logic Quarterly 50 (6):533-539.
A standard model of Peano Arithmetic with no conservative elementary extension.Ali Enayat - 2008 - Annals of Pure and Applied Logic 156 (2):308-318.
Subsets of models of arithmetic.Roman Kossak & Jeffrey B. Paris - 1992 - Archive for Mathematical Logic 32 (1):65-73.
Partially-Elementary Extension Kripke Models: A Characterization and Applications.Tomasz Połacik - 2006 - Logic Journal of the IGPL 14 (1):73-86.
On certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
The elementary diagram of a trivial, weakly minimal structure is near model complete.Michael C. Laskowski - 2009 - Archive for Mathematical Logic 48 (1):15-24.
The Diversity of Minimal Cofinal Extensions.James H. Schmerl - 2022 - Notre Dame Journal of Formal Logic 63 (4):493-514.
Conservative extensions of models of arithmetic.Andreas Blass - 1980 - Archive for Mathematical Logic 20 (3-4):85-94.
Recursive ultrapowers, simple models, and cofinal extensions.T. G. McLaughlin - 1992 - Archive for Mathematical Logic 31 (4):287-296.

Analytics

Added to PP
2013-11-23

Downloads
31 (#504,102)

6 months
4 (#1,006,062)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Boolean-Valued Models and Independence Proofs in Set Theory.J. L. Bell & Dana Scott - 1981 - Journal of Symbolic Logic 46 (1):165-165.
The theory of Boolean ultrapowers.Richard Mansfield - 1971 - Annals of Mathematical Logic 2 (3):297-323.
Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.

View all 10 references / Add more references