Switch to: References

Add citations

You must login to add citations.
  1. Super/rosy L k -theories and classes of finite structures.Cameron Donnay Hill - 2013 - Annals of Pure and Applied Logic 164 (10):907-927.
    We recover the essentials of þ-forking, rosiness and super-rosiness for certain amalgamation classes K, and thence of finite-variable theories of finite structures. This provides a foundation for a model-theoretic analysis of a natural extension of the “LkLk-Canonization Problem” – the possibility of efficiently recovering finite models of T given a finite presentation of an LkLk-theory T. Some of this work is accomplished through different sorts of “transfer” theorem to the first-order theory TlimTlim of the direct limit. Our results include, to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Independence and the finite submodel property.Vera Koponen - 2009 - Annals of Pure and Applied Logic 158 (1-2):58-79.
    We study a class of 0-categorical simple structures such that every M in has uncomplicated forking behavior and such that definable relations in M which do not cause forking are independent in a sense that is made precise; we call structures in independent. The SU-rank of such M may be n for any natural number n>0. The most well-known unstable member of is the random graph, which has SU-rank one. The main result is that for every strongly independent structure M (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Binary primitive homogeneous simple structures.Vera Koponen - 2017 - Journal of Symbolic Logic 82 (1):183-207.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Binary simple homogeneous structures.Vera Koponen - 2018 - Annals of Pure and Applied Logic 169 (12):1335-1368.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry.Cameron Donnay Hill - 2016 - Annals of Pure and Applied Logic 167 (11):1093-1122.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation