Binary primitive homogeneous simple structures
From MaRDI portal
Abstract: Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure does not hold if the binarity condition is removed, as witnessed by the generic tetrahedron-free 3-hypergraph. However, to show that the generic tetrahedron-free 3-hypergraph is 1-based requires some work (it is known that it has the other properties) since this notion is defined in terms of imaginary elements. This is partly why we also characterize equivalence relations which are definable without parameters in the context of omega-categorical structures with degenerate algebraic closure. Another reason is that such characterizations may be useful in future research about simple (nonbinary) homogeneous structures.
Recommendations
Cites work
- A geometric introduction to forking and thorn-forking
- A survey of homogeneous structures
- AN AXIOMATIC APPROACH TO FREE AMALGAMATION
- Binary simple homogeneous structures are supersimple with finite rank
- Coordinatisation and canonical bases in simple theories
- Finite satisfiability and ℵ0-categorical structures with trivial dependence
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1064592 (Why is no real title available?)
- scientific article; zbMATH DE number 1425669 (Why is no real title available?)
- Interpreting groups in ω-categorical structures
- On sets with rank one in simple homogeneous structures
- Some trivial considerations
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- The finite submodel property and \(\omega\)-categorical expansions of pregeometries
- The geometry of 1-based minimal types
Cited in
(9)- Binary simple homogeneous structures
- Simple structures axiomatized by almost sure theories
- Binary simple homogeneous structures are supersimple with finite rank
- On sets with rank one in simple homogeneous structures
- Finiteness of U‐rank implies simplicity in homogeneous structures
- Generalized amalgamation and homogeneity
- On constraints and dividing in ternary homogeneous structures
- Homogeneous 1-based structures and interpretability in random structures
- scientific article; zbMATH DE number 7703228 (Why is no real title available?)
This page was built for publication: Binary primitive homogeneous simple structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738197)