Switch to: References

Add citations

You must login to add citations.
  1. Indivisible sets and well‐founded orientations of the Rado graph.Nathanael L. Ackerman & Will Brian - 2019 - Mathematical Logic Quarterly 65 (1):46-56.
    Every set can been thought of as a directed graph whose edge relation is ∈. We show that many natural examples of directed graphs of this kind are indivisible: for every infinite κ, for every indecomposable λ, and every countable model of set theory. All of the countable digraphs we consider are orientations of the countable random graph. In this way we find indivisible well‐founded orientations of the random graph that are distinct up to isomorphism, and ℵ1 that are distinct (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Antichains of copies of ultrahomogeneous structures.Miloš S. Kurilić & Boriša Kuzeljević - 2022 - Archive for Mathematical Logic 61 (5):867-879.
    We investigate possible cardinalities of maximal antichains in the poset of copies \,\subseteq \rangle \) of a countable ultrahomogeneous relational structure \. It turns out that if the age of \ has the strong amalgamation property, then, defining a copy of \ to be large iff it has infinite intersection with each orbit of \, the structure \ can be partitioned into countably many large copies, there are almost disjoint families of large copies of size continuum and, hence, there are (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark