Switch to: Citations

Add references

You must login to add references.
  1. Coinductive $aleph_0$-Categorical Theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130-1137.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
    Download  
     
    Export citation  
     
    Bookmark   204 citations  
  • Coinductive ℵ0-categorical theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130 - 1137.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Relational structures determined by their finite induced substructures.I. M. Hodkinson & H. D. Macpherson - 1988 - Journal of Symbolic Logic 53 (1):222-230.
    A countably infinite relational structure M is called absolutely ubiquitous if the following holds: whenever N is a countably infinite structure, and M and N have the same isomorphism types of finite induced substructures, there is an isomorphism from M to N. Here a characterisation is given of absolutely ubiquitous structures over languages with finitely many relation symbols. A corresponding result is proved for uncountable structures.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Complete theories with only universal and existential axioms.A. H. Lachlan - 1987 - Journal of Symbolic Logic 52 (3):698-711.
    Let T be a complete first-order theory over a finite relational language which is axiomatized by universal and existential sentences. It is shown that T is almost trivial in the sense that the universe of any model of T can be written $F \overset{\cdot}{\cup} I_1 \overset{\cdot}{\cup} I_2 \overset{\cdot}{\cup} \cdots \overset{\cdot}{\cup} I_n$ , where F is finite and I 1 , I 2 ,...,I n are mutually indiscernible over F. Some results about complete theories with ∃∀-axioms over a finite relational language (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations