Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-11T10:47:38.007Z Has data issue: false hasContentIssue false

BINARY PRIMITIVE HOMOGENEOUS SIMPLE STRUCTURES

Published online by Cambridge University Press:  21 March 2017

VERA KOPONEN*
Affiliation:
DEPARTMENT OF MATHEMATICS UPPSALA UNIVERSITY BOX 480, 75106 UPPSALA, SWEDEN E-mail: vera.koponen@math.uu.se
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Suppose that ${\cal M}$ is countable, binary, primitive, homogeneous, and simple. We prove that the SU-rank of the complete theory of ${\cal M}$ is 1 and hence 1-based. It follows that ${\cal M}$ is a random structure. The conclusion that ${\cal 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 ω-categorical structures with degenerate algebraic closure. Another reason is that such characterizations may be useful in future research about simple (nonbinary) homogeneous structures.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2017