Triviality, NDOP and stable varieties

Annals of Pure and Applied Logic 62 (2):119-146 (1993)
  Copy   BIBTEX

Abstract

We study perfectly trivial theories, 1-based theories, stable varieties, and their mutual interaction. We give a structure theorem for the models of a complete perfectly trivial stable theory without DOP: any model is the algebraic closure of a nonforking regular tree of elements. We also give a structure theorem for stable varieties, all of whose completions have NDOP. Such a variety is a varietal product of an affine variety and a combinatorial variety of an especially simple form

Links

PhilArchive



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

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

An Old Friend Revisited: Countable Models of ω-Stable Theories.Michael C. Laskowski - 2007 - Notre Dame Journal of Formal Logic 48 (1):133-141.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
Ample dividing.David M. Evans - 2003 - Journal of Symbolic Logic 68 (4):1385-1402.
CM-Triviality and stable groups.Frank O. Wagner - 1998 - Journal of Symbolic Logic 63 (4):1473-1495.
1-based theories — the main gap for a -models.B. Hart, A. Pillay & S. Starchenko - 1995 - Archive for Mathematical Logic 34 (5):285-300.
A Remark on Algebraic Closure and Orthogonality.Tapani Hyttinen - 1998 - Notre Dame Journal of Formal Logic 39 (4):527-530.
A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
Presentism, triviality, and the varieties of tensism.Peter Ludlow - 2004 - Oxford Studies in Metaphysics 1:21-36.
A construction of superstable NDOP-NOTOP groups.Andreas Baudisch - 1991 - Journal of Symbolic Logic 56 (4):1385-1390.
Remarks on Structure Theorems for -Saturated Models.Tapani Hyttinen - 1995 - Notre Dame Journal of Formal Logic 36 (2):269-278.
Finding generically stable measures.Pierre Simon - 2012 - Journal of Symbolic Logic 77 (1):263-278.
CM-triviality and generic structures.Ikuo Yoneda - 2003 - Archive for Mathematical Logic 42 (5):423-433.
Adding linear orders.Saharon Shelah & Pierre Simon - 2012 - Journal of Symbolic Logic 77 (2):717-725.
Triviality Pursuit.Alan Hájek - 2011 - Topoi 30 (1):3-15.
Regular types in nonmultidimensional ω-stable theories.Anand Pillay - 1984 - Journal of Symbolic Logic 49 (3):880-891.

Analytics

Added to PP
2014-01-16

Downloads
17 (#815,534)

6 months
7 (#339,156)

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

Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
Some trivial considerations.John B. Goode - 1991 - Journal of Symbolic Logic 56 (2):624-631.
Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.
Trivial pursuit: Remarks on the main gap.John T. Baldwin & Leo Harrington - 1987 - Annals of Pure and Applied Logic 34 (3):209-230.

View all 7 references / Add more references