Finite Satisfiability and N₀-Categorical Structures with Trivial Dependence
Journal of Symbolic Logic 71 (3):810 - 830 (2006)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesDavid M. Evans & Frank O. Wagner (2000). Supersimple Ω-Categorical Groups and Theories. Journal of Symbolic Logic 65 (2):767-776.
Ian Hodkinson & Martin Otto (2003). Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures. Bulletin of Symbolic Logic 9 (3):387-405.
Dugald MacPherson (1991). Interpreting Groups in Ω-Categorical Structures. Journal of Symbolic Logic 56 (4):1317-1324.
Anand Pillay (1995). The Geometry of Forking and Groups of Finite Morley Rank. Journal of Symbolic Logic 60 (4):1251-1259.
Martin Otto (2001). Two Variable First-Order Logic Over Ordered Domains. Journal of Symbolic Logic 66 (2):685-702.
Peter Lohmann & Heribert Vollmer (2013). Complexity Results for Modal Dependence Logic. Studia Logica 101 (2):343-366.
A. C. Walczak-Typke (2005). The First-Order Structure of Weakly Dedekind-Finite Sets. Journal of Symbolic Logic 70 (4):1161 - 1170.
Ian Pratt-Hartmann (2008). On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. The Bulletin of Symbolic Logic 14 (1):1 - 28.
James H. Schmerl (1981). Decidability and Finite Axiomatizability of Theories of ℵ0-Categorical Partially Ordered Sets. Journal of Symbolic Logic 46 (1):101 - 120.
Walter Baur (1975). ℵ0-Categorical Modules. Journal of Symbolic Logic 40 (2):213 - 220.
Yuri Gurevich & Saharon Shelah (1996). On Finite Rigid Structures. Journal of Symbolic Logic 61 (2):549-562.
James Loveys & Predrag Tanović (1996). Countable Models of Trivial Theories Which Admit Finite Coding. Journal of Symbolic Logic 61 (4):1279-1286.
Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon (2005). Computable Categoricity of Trees of Finite Height. Journal of Symbolic Logic 70 (1):151 - 215.
Petr Cintula (2005). Two Notions of Compactness in Gödel Logics. Studia Logica 81 (1):99 - 122.
Herwig Nübling (2005). Reducts of Stable, CM-Trivial Theories. Journal of Symbolic Logic 70 (4):1025 - 1036.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads1 ( #274,507 of 548,941 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
