Homogeneous 1-based structures and interpretability in random structures

DOI10.1002/MALQ.201400096MaRDI QIDQ5108085zbMATH OpenOpenAlexFDO

Authors Vera Koponen

Publication date 29 April 2020

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.3757

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Combinatorial probability (60C05)

Abstract: Let $V$ be a finite relational vocabulary in which no symbol has arity greater than 2. Let $M$ be countable $V$-structure which is homogeneous, simple and 1-based. The first main result says that if $M$ 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 $M$ is "coordinatized" by a set with SU-rank 1 and there is no definable (without parameters) nontrivial equivalence relation on $M$ with only finite classes, then $M$ is strongly interpretable in a random structure.

Recommendations

• Binary primitive homogeneous simple structures
• On sets with rank one in simple homogeneous structures
• Independence and the finite submodel property
• Stable Finitely Homogeneous Structures
• Binary simple homogeneous structures are supersimple with finite rank

Cites work

• \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures
• A survey of homogeneous structures
• Binary simple homogeneous structures are supersimple with finite rank
• Classification theory and the number of non-isomorphic models.
• Colouring, constraint satisfaction, and complexity
• Coordinatisation and canonical bases in simple theories
• Countable homogeneous multipartite graphs
• Countable homogeneous partially ordered sets
• Countable homogeneous relational structures and ℵ₀-categorical theories
• Countable Homogeneous Tournaments
• Countable Ultrahomogeneous Undirected Graphs
• Finite Homogeneous 3‐Graphs
• Finite satisfiability and ℵ₀-categorical structures with trivial dependence
• Graph theory
• Homogeneous graphs
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 1043731 (Why is no real title available?)
• scientific article; zbMATH DE number 1912564 (Why is no real title available?)
• scientific article; zbMATH DE number 1425669 (Why is no real title available?)
• scientific article; zbMATH DE number 272725 (Why is no real title available?)
• Interpreting groups in ω-categorical structures
• On sets with rank one in simple homogeneous structures
• Ramsey Classes and Homogeneous Structures
• Reducts of Ramsey structures
• Simple theories and hyperimaginaries
• Smoothly Embeddable Subgraphs
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• The geometry of 1-based minimal types
• ℵ₀ -Categorical Structures Smoothly Approximated by Finite Substructures

Cited in

(4)

• Binary simple homogeneous structures
• Binary simple homogeneous structures are supersimple with finite rank
• On sets with rank one in simple homogeneous structures
• Generalized amalgamation and homogeneity

This page was built for publication: Homogeneous 1-based structures and interpretability in random structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108085)