Finitely Axiomatizable ω-Categorical Theories and the Mazoyer Hypothesis

Journal of Symbolic Logic 70 (2):460 - 472 (2005)
Abstract
Let F be the class of complete, finitely axiomatizable ω-categorical theories. It is not known whether there are simple theories in F. We prove three results of the form: if T ∈ F has a sufficently well-behaved definable set J, then T is not simple. (In one case, we actually prove that T has the strict order property.) All of our arguments assume that the definable set J satisfies the Mazoyer hypothesis, which controls how an element of J can be algebraic over a subset of the model. For every known example in F, there is a definable set satisfying the Mazoyer hypothesis
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 12,084
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
André Nies (2007). Describing Groups. Bulletin of Symbolic Logic 13 (3):305-339.
Ehud Hrushovski (1989). Finitely Based Theories. Journal of Symbolic Logic 54 (1):221-225.
Analytics

Monthly downloads

Added to index

2010-08-24

Total downloads

3 ( #307,951 of 1,101,880 )

Recent downloads (6 months)

2 ( #191,964 of 1,101,880 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.