Switch to: Citations

Add references

You must login to add references.
  1. Counterexamples to a conjecture on relative categoricity.David M. Evans & P. R. Hewitt - 1990 - Annals of Pure and Applied Logic 46 (2):201-209.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • ℵ0-Categorical, ℵ0-stable structures.Gregory Cherlin, Leo Harrington & Alistair H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • Cell decompositions of C-minimal structures.Deirdre Haskell & Dugald Macpherson - 1994 - Annals of Pure and Applied Logic 66 (2):113-162.
    C-minimality is a variant of o-minimality in which structures carry, instead of a linear ordering, a ternary relation interpretable in a natural way on set of maximal chains of a tree. This notion is discussed, a cell-decomposition theorem for C-minimal structures is proved, and a notion of dimension is introduced. It is shown that C-minimal fields are precisely valued algebraically closed fields. It is also shown that, if certain specific ‘bad’ functions are not definable, then algebraic closure has the exchange (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Simple unstable theories.Saharon Shelah - 1980 - Annals of Mathematical Logic 19 (3):177.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • (1 other version)Algebraic theories with definable Skolem functions.Lou van den Dries - 1984 - Journal of Symbolic Logic 49 (2):625-629.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Algebraic types and automorphism groups.Akito Tsuboi - 1993 - Journal of Symbolic Logic 58 (1):232-239.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Generic expansions of ω-categorical structures and semantics of generalized quantifiers.A. A. Ivanov - 1999 - Journal of Symbolic Logic 64 (2):775-789.
    LetMbe a countably infinite ω-categorical structure. Consider Aut(M) as a complete metric space by definingd(g, h) = Ω{2−n:g(xn) ≠h(xn) org−1(xn) ≠h−1(xn)} where {xn:n∈ ω} is an enumeration ofMAn automorphism α ∈ Aut(M) is generic if its conjugacy class is comeagre. J. Truss has shown in [11] that if the set P of all finite partial isomorphisms contains a co-final subset P1closed under conjugacy and having the amalgamation property and the joint embedding property then there is a generic automorphism. In the (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • On the automorphism groups of finite covers.David M. Evans & Ehud Hrushovski - 1993 - Annals of Pure and Applied Logic 62 (2):83-112.
    We are concerned with identifying by how much a finite cover of an 0-categorical structure differs from a sequence of free covers. The main results show that this is measured by automorphism groups which are nilpotent-by-abelian. In the language of covers, these results say that every finite cover can be decomposed naturally into linked, superlinked and free covers. The superlinked covers arise from covers over a different base, and to describe this properly we introduce the notion of a quasi-cover.These results (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Reducts of the random graph.Simon Thomas - 1991 - Journal of Symbolic Logic 56 (1):176-181.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Finite covers with finite kernels.David M. Evans - 1997 - Annals of Pure and Applied Logic 88 (2-3):109-147.
    We are concerned with the following problem. Suppose Γ and Σ are closed permutation groups on infinite sets C and W and ρ: Γ → Σ is a non-split, continuous epimorphism with finite kernel. Describe the possibilities for ρ. Here, we consider the case where ρ arises from a finite cover π: C → W. We give reasonably general conditions on the permutation structure W;Σ which allow us to prove that these covers arise in two possible ways. The first way, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A version of o-minimality for the p-adics.Deirdre Haskell & Dugald Macpherson - 1997 - Journal of Symbolic Logic 62 (4):1075-1092.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Finitely axiomatizable ℵ1 categorical theories.Ehud Hrushovski - 1994 - Journal of Symbolic Logic 59 (3):838 - 844.
    Finitely axiomatizable ℵ 1 categorical theories are locally modular.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Countable homogeneous relational structures and ℵ0-categorical theories.C. Ward Henson - 1972 - Journal of Symbolic Logic 37 (3):494 - 500.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • One-dimensional fibers of rigid subanalytic sets.L. Lipshitz & Z. Robinson - 1998 - Journal of Symbolic Logic 63 (1):83-88.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)An introduction to forking.Daniel Lascar & Bruno Poizat - 1979 - Journal of Symbolic Logic 44 (3):330-350.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • On the category of models of a complete theory.Daniel Lascar - 1982 - Journal of Symbolic Logic 47 (2):249-266.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • (1 other version)Algebraic Theories with Definable Skolem Functions.Lou van Den Dries - 1984 - Journal of Symbolic Logic 49 (2):625 - 629.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • An Introduction to Stability Theory.Anand Pillay - 1986 - Journal of Symbolic Logic 51 (2):465-467.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Stability in Model Theory.Daniel Lascar & J. E. Wallington - 1990 - Journal of Symbolic Logic 55 (2):881-883.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
    Download  
     
    Export citation  
     
    Bookmark   104 citations  
  • Finite axiomatizability and theories with trivial algebraic closure.Dugald Macpherson - 1991 - Notre Dame Journal of Formal Logic 32 (2):188-192.
    Download  
     
    Export citation  
     
    Bookmark   6 citations