Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • 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  
  • Binary simple homogeneous structures.Vera Koponen - 2018 - Annals of Pure and Applied Logic 169 (12):1335-1368.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Supersimple ω-categorical theories and pregeometries.Vera Koponen - 2019 - Annals of Pure and Applied Logic 170 (12):102718.
    Download  
     
    Export citation  
     
    Bookmark