On simplicity of bounded pseudoalgebraically closed structures

Journal of Mathematical Logic 7 (2):173-193 (2007)
  Copy   BIBTEX

Abstract

Bounded PAC substructures of models of stable theory T are generalizations of bounded PAC fields and bounded PAC beautiful pairs generalize Poizat's beautiful pairs. Both notions were introduced in the authors Ph.D. thesis. In this paper, we prove that under the assumption that the PAC property is first order for T, the theory of any bounded PAC structure is simple. Moreover, if the PAC property is first order for T and T does not have the finite cover property, then the theory of any bounded PAC beautiful pair is simple. We, also, give a characterization of dividing in both cases.

Links

PhilArchive



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

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

Dominating and unbounded free sets.Slawomir Solecki & Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (1):75-80.
Filtral powers of structures.P. Ouwehand & H. Rose - 1998 - Journal of Symbolic Logic 63 (4):1239-1254.
Quasi-modal equivalence of canonical structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
What is the problem of simplicity?Elliott Sober - 2001 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference and Modelling: Keeping It Sophisticatedly Simple. New York: Cambridge University Press. pp. 13-32.
Automorphism groups of trivial strongly minimal structures.Thomas Blossier - 2003 - Journal of Symbolic Logic 68 (2):644-668.
Simplicity.Elliott Sober - 1975 - Oxford: Clarendon Press.
0-1 laws for recursive structures.E. Grädel & A. Malmström - 1999 - Archive for Mathematical Logic 38 (4-5):205-215.

Analytics

Added to PP
2010-08-30

Downloads
12 (#1,088,955)

6 months
3 (#982,484)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Model theoretic dynamics in Galois fashion.Daniel Max Hoffmann - 2019 - Annals of Pure and Applied Logic 170 (7):755-804.
Un critère simple.Thomas Blossier & Amador Martin-Pizarro - 2019 - Notre Dame Journal of Formal Logic 60 (4):639-663.

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.
Stable theories with a new predicate.Enrique Casanovas & Martin Ziegler - 2001 - Journal of Symbolic Logic 66 (3):1127-1140.
Simple Theories.Frank O. Wagner - 2002 - Bulletin of Symbolic Logic 8 (4):522-524.

Add more references