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)|
|Through your library||Configure|
Similar books and articles
George Weaver & David Lippel (1998). Classifying ℵo-Categorical Theories II: The Existence of Finitely Axiomatizable Proper Class II Theories. Studia Logica 60 (2):275-297.
Ehud Hrushovski (1994). Finitely Axiomatizable ℵ1 Categorical Theories. Journal of Symbolic Logic 59 (3):838 - 844.
George Weaver (2011). A General Setting for Dedekind's Axiomatization of the Positive Integers. History and Philosophy of Logic 32 (4):375-398.
James H. Schmerl (1981). Decidability and Finite Axiomatizability of Theories of ℵ0-Categorical Partially Ordered Sets. Journal of Symbolic Logic 46 (1):101 - 120.
Leszek Aleksander Kołodziejczyk (2006). On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories. Journal of Symbolic Logic 71 (2):624 - 638.
David M. Evans & Frank O. Wagner (2000). Supersimple Ω-Categorical Groups and Theories. Journal of Symbolic Logic 65 (2):767-776.
Clark Glymour (2012). On the Possibility of Inference to the Best Explanation. Journal of Philosophical Logic 41 (2):461-469.
Nick Bezhanishvili & Ian Hodkinson (2004). All Normal Extensions of S5-Squared Are Finitely Axiomatizable. Studia Logica 78 (3):443 - 457.
Roman Wencel (2003). Definable Sets in Boolean Ordered o-Minimal Structures. II. Journal of Symbolic Logic 68 (1):35-51.
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.
Miklós Maróti & Ralph McKenzie (2004). Finite Basis Problems and Results for Quasivarieties. Studia Logica 78 (1-2):293 - 320.
Tadeusz Litak & Frank Wolter (2005). All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-Complete. Studia Logica 81 (2):153 - 165.
Valentin Shehtman (1990). Modal Counterparts of Medvedev Logic of Finite Problems Are Not Finitely Axiomatizable. Studia Logica 49 (3):365 - 385.
Sorry, there are not enough data points to plot this chart.
Added to index2010-08-24
Total downloads1 ( #290,877 of 722,700 )
Recent downloads (6 months)0
How can I increase my downloads?