Bounded Scott Set Saturation

Mathematical Logic Quarterly 48 (2):245-259 (2002)
  Copy   BIBTEX

Abstract

We examine the relationship between two different notions of a structure being Scott set saturated and identify sufficient conditions which guarantee that a structure is uniquely Scott set saturated. We also consider theories representing Scott sets; in particular, we identify a sufficient condition on a theory T so that for any given countable Scott set there exists a completion of T that is saturated with respect to the given Scott set. These results extend Scott's characterization of countable Scott sets via models and completions of Peano arithmetic

Links

PhilArchive



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

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

Computability in structures representing a Scott set.Alex M. McAllister - 2001 - Archive for Mathematical Logic 40 (3):147-165.
On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
A Remark on Independence Results for Sharply Bounded Arithmetic.Jan Johannsen - 1998 - Mathematical Logic Quarterly 44 (4):568-570.
Two General Results on Intuitionistic Bounded Theories.Fernando Ferreira - 1999 - Mathematical Logic Quarterly 45 (3):399-407.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
An Independence Result on Weak Second Order Bounded Arithmetic.Satoru Kuroda - 2001 - Mathematical Logic Quarterly 47 (2):183-186.
The strength of sharply bounded induction.Emil Jeřábek - 2006 - Mathematical Logic Quarterly 52 (6):613-624.
Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
Saturation, Suslin trees and meager sets.Paul Larson - 2005 - Archive for Mathematical Logic 44 (5):581-595.

Analytics

Added to PP
2013-12-01

Downloads
19 (#778,470)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Expansions of models and Turing degrees.Julia Knight & Mark Nadel - 1982 - Journal of Symbolic Logic 47 (3):587-604.

Add more references