Abstract.
Let 𝒜 be a computable structure and let R be a new relation on its domain. We establish a necessary and sufficient condition for the existence of a copy ℬ of 𝒜 in which the image of R (¬R, resp.) is simple (immune, resp.) relative to ℬ. We also establish, under certain effectiveness conditions on 𝒜 and R, a necessary and sufficient condition for the existence of a computable copy ℬ of 𝒜 in which the image of R (¬R, resp.) is simple (immune, resp.).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Author information
Authors and Affiliations
Additional information
Received: 4 February 2001 Published online: 5 November 2002
RID="*"
ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899.
RID="*"
ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899.
RID="*"
ID="*" The first three authors gratefully acknowledge support of the NFS Binational Grant DMS-0075899.
Rights and permissions
About this article
Cite this article
Goncharov, S., Harizanov, V., Knight, J. et al. Simple and immune relations on countable structures. Arch. Math. Logic 42, 279–291 (2003). https://doi.org/10.1007/s00153-002-0150-2
Issue Date:
DOI: https://doi.org/10.1007/s00153-002-0150-2