Switch to: References

Add citations

You must login to add citations.
  1. Some aspects of model theory and finite structures.Eric Rosen - 2002 - Bulletin of Symbolic Logic 8 (3):380-403.
    Model theory is concerned mainly, although not exclusively, with infinite structures. In recent years, finite structures have risen to greater prominence, both within the context of mainstream model theory, e.g., in work of Lachlan, Cherlin, Hrushovski, and others, and with the advent of finite model theory, which incorporates elements of classical model theory, combinatorics, and complexity theory. The purpose of this survey is to provide an overview of what might be called the model theory of finite structures. Some topics in (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Homogeneous 1‐based structures and interpretability in random structures.Vera Koponen - 2017 - Mathematical Logic Quarterly 63 (1-2):6-18.
    Let V be a finite relational vocabulary in which no symbol has arity greater than 2. Let be countable V‐structure which is homogeneous, simple and 1‐based. The first main result says that if is, in addition, primitive, then it is strongly interpretable in a random structure. The second main result, which generalizes the first, implies (without the assumption on primitivity) that if is “coordinatized” by a set with SU‐rank 1 and there is no definable (without parameters) nontrivial equivalence relation on (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Binary simple homogeneous structures.Vera Koponen - 2018 - Annals of Pure and Applied Logic 169 (12):1335-1368.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Infinite imprimitive homogeneous 3-edge-colored complete graphs.Gregory L. Cherlin - 1999 - Journal of Symbolic Logic 64 (1):159-179.
  • On countable homogeneous 3-hypergraphs.Reza Akhtar & Alistair H. Lachlan - 1995 - Archive for Mathematical Logic 34 (5):331-344.
    We present some results on countable homogeneous 3-hypergraphs. In particular, we show that there is no unexpected homogeneous 3-hypergraph determined by a single constraint.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Random ℓ‐colourable structures with a pregeometry.Ove Ahlman & Vera Koponen - 2017 - Mathematical Logic Quarterly 63 (1-2):32-58.
    We study finite ℓ‐colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures by which colours are first randomly assigned to all 1‐dimensional subspaces and then relationships are assigned in such a way that the colouring conditions are satisfied but apart from this in a random way. We can then ask what the probability is that the resulting structure, where we now forget the specific colouring of the generating process, has (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation