On Lovely Pairs and the (∃ y ∈ P ) Quantifier

&
Notre Dame Journal of Formal Logic 46 (4):491-501 (2005)
  Copy   BIBTEX

Abstract

Given a lovely pair P ≺ M of models of a simple theory T, we study the structure whose universe is P and whose relations are the traces on P of definable (in ℒ with parameters from M) sets in M. We give a necessary and sufficient condition on T (which we call weak lowness) for this structure to have quantifier-elimination. We give an example of a non-weakly-low simple theory

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1134397664

Links

PhilArchive



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

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

On the Weak Non-Finite Cover Property and the n-Tuples of Simple Structures.Evgueni Vassiliev - 2005 - Journal of Symbolic Logic 70 (1):235 - 251.
On Supersimplicity and Lovely Pairs of Cats.Itay Ben-Yaacov - 2006 - Journal of Symbolic Logic 71 (3):763 - 776.
T-convexity and Tame extensions.LouDen Dries & Adam H. Lewenberg - 1995 - Journal of Symbolic Logic 60 (1):74 - 102.
Three quantifier sentences.Harvey Friedman - manuscript
Sluicing and constraints on quantifier scope.Kyle Johnson - manuscript
Range of violations of bell’s inequality by entangled photon pairs entangled photon pairs.Fred Kronz - unknown
Compactness and independence in non first order frameworks.Itay Ben-Yaacov - 2005 - Bulletin of Symbolic Logic 11 (1):28-50.
On the definability of the quantifier “there exist uncountably many”.Žarko Mijajlović - 1985 - Studia Logica 44 (3):257 - 264.
You are simple.David Barnett - 2010 - In Robert C. Koons & George Bealer (eds.), The Waning of Materialism. Oxford University Press. pp. 161--174.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
The lovely and the probable. [REVIEW]Christopher Hitchcock - 2007 - Philosophy and Phenomenological Research 74 (2):433–440.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
Quantifier probability logic and the confirmation paradox.Theodore Hailperin - 2007 - History and Philosophy of Logic 28 (1):83-100.

Analytics

Added to PP
2010-08-24

Downloads
17 (#872,413)

6 months
4 (#797,974)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Weakly one-based geometric theories.Alexander Berenstein & Evgueni Vassiliev - 2012 - Journal of Symbolic Logic 77 (2):392-422.

Add more citations

References found in this work

Lovely pairs of models.Itay Ben-Yaacov, Anand Pillay & Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 122 (1-3):235-261.
The number of types in simple theories.Enrique Casanovas - 1999 - Annals of Pure and Applied Logic 98 (1-3):69-86.
Paires de structures o-minimales.Yerzhan Baisalov & Bruno Poizat - 1998 - Journal of Symbolic Logic 63 (2):570-578.

Add more references