Abstract
We study definable sets of SU-rank 1 in , where is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such can be seen as a `canonically embedded structure', which inherits all relations on which are definable in , and has no other definable relations. Our results imply that if no relation symbol of the language of has arity higher than 2, then there is a close relationship between triviality of dependence and being a reduct of a binary random structure. Somewhat more preciely: (a) if for every , every -type which is realized in is determined by its sub-2-types , then the algebraic closure restricted to is trivial; (b) if has trivial dependence, then is a reduct of a binary random structure.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.