Loading [MathJax]/extensions/MathZoom.js
A structure is called homomorphism-homogeneous if every homomorphism between finitely generated substructures of the structure extends to an endomorphism of the structure (P. J. Cameron and J. Nešetřil, 2006). In this paper we introduce oligomorphic transformation monoids in full analogy to oligomorphic permutation groups and use this notion to propose a solution to a problem, posed by Cameron and Nešetřil in 2006, to characterize endomorphism monoids of homomorphism-homogeneous relational structures...
We study definable sets D of SU-rank 1 in , where ℳ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such D can be seen as a ’canonically embedded structure’, which inherits all relations on D 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...
We prove:
Theorem. If T is a countable, complete, stable, first-order theory having an infinite set of constants with different interpretations, then I(T,ℵ₀) ≥ ℵ₀.
Currently displaying 1 –
7 of
7