CM-triviality and generic structures

Archive for Mathematical Logic 42 (5):423-433 (2003)
  Copy   BIBTEX

Abstract

We show that any relational generic structure whose theory has finite closure and amalgamation over closed sets is stable CM-trivial with weak elimination of imaginaries

Categories

Keywords

Reprint years

DOI

10.1007/s00153-002-0148-9

Links

PhilArchive



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

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

Ab initio generic structures which are superstable but not ω-stable.Koichiro Ikeda - 2012 - Archive for Mathematical Logic 51 (1):203-211.
Schnorr triviality and genericity.Johanna N. Y. Franklin - 2010 - Journal of Symbolic Logic 75 (1):191-207.
On superstable generic structures.Koichiro Ikeda & Hirotaka Kikyo - 2012 - Archive for Mathematical Logic 51 (5-6):591-600.
Elimination of Imaginaries in Expansions of O-Minimal Structures by Generic Sets.Sergio Fratarcangeli - 2005 - Journal of Symbolic Logic 70 (4):1150 - 1160.
On generic structures with a strong amalgamation property.Koichiro Ikeda, Hirotaka Kikyo & Akito Tsuboi - 2009 - Journal of Symbolic Logic 74 (3):721-733.
Ages of Expansions of ω-Categorical Structures.A. Ivanov & K. Majcher - 2007 - Notre Dame Journal of Formal Logic 48 (3):371-380.
CM-triviality and relational structures.Viktor Verbovskiy & Ikuo Yoneda - 2003 - Annals of Pure and Applied Logic 122 (1-3):175-194.
Almost weakly 2-generic sets.Stephen A. Fenner - 1994 - Journal of Symbolic Logic 59 (3):868-887.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Automorphisms of Homogeneous Structures.A. Ivanov - 2005 - Notre Dame Journal of Formal Logic 46 (4):419-424.
Every 1-Generic Computes a Properly 1-Generic.Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1385 - 1393.
Computability in structures representing a Scott set.Alex M. McAllister - 2001 - Archive for Mathematical Logic 40 (3):147-165.
Indifferent sets for genericity.Adam R. Day - 2013 - Journal of Symbolic Logic 78 (1):113-138.
Generic Expansions of Countable Models.Silvia Barbina & Domenico Zambella - 2012 - Notre Dame Journal of Formal Logic 53 (4):511-523.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.

Analytics

Added to PP
2013-11-23

Downloads
32 (#485,568)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

CM-triviality and relational structures.Viktor Verbovskiy & Ikuo Yoneda - 2003 - Annals of Pure and Applied Logic 122 (1-3):175-194.

Add more citations

References found in this work

No references found.

Add more references