A note on Σ 1 -maximal models

Journal of Symbolic Logic 72 (3):1072-1078 (2007)
  Copy   BIBTEX

Abstract

LetTbe a recursive theory in the language of first order Arithmetic. We prove that ifTextends: (a) the scheme of parameter free Δ1-minimization (plusexp). or (b) the scheme of parameter free Π1-induction, then there are no Σ1-maximal models with respect toT. As a consequence, we obtain a new proof of an unpublished theorem of Jeff Paris stating that Σ1-maximal models with respect toIΔ0+expdo not satisfy the scheme of Σ1-collectionBΣ1.

Links

PhilArchive



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

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

Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
Toward categoricity for classes with no maximal models.Saharon Shelah & Andrés Villaveces - 1999 - Annals of Pure and Applied Logic 97 (1-3):1-25.
The spectrum of maximal independent subsets of a Boolean algebra.J. Donald Monk - 2004 - Annals of Pure and Applied Logic 126 (1-3):335-348.
A Note on Recursive Models of Set Theories.Domenico Zambella & Antonella Mancini - 2001 - Notre Dame Journal of Formal Logic 42 (2):109-115.
Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.
Automorphisms with only infinite orbits on non-algebraic elements.Grégory Duby - 2003 - Archive for Mathematical Logic 42 (5):435-447.

Analytics

Added to PP
2010-08-24

Downloads
27 (#604,409)

6 months
2 (#1,243,547)

Historical graph of downloads
How can I increase my downloads?