Simple and immune relations on countable structures

, , &
Archive for Mathematical Logic 42 (3):279-291 (2003)
  Copy   BIBTEX

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.).

Categories

Keywords

Reprint years

DOI

10.1007/s00153-002-0150-2

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Possible degrees in recursive copies.C. J. Ash & J. F. Knight - 1995 - Annals of Pure and Applied Logic 75 (3):215-221.
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Degree spectra of relations on a cone.Matthew Harrison-Trainor - 2018 - Providence, RI: American Mathematical Society.
Inseparability in recursive copies.Kevin J. Davey - 1994 - Annals of Pure and Applied Logic 68 (1):1-52.
Notions of compactness for special subsets of ℝ I and some weak forms of the axiom of choice.Marianne Morillon - 2010 - Journal of Symbolic Logic 75 (1):255-268.
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.
The Complexity of Decomposability of Computable Rings.Huishan Wu - 2023 - Notre Dame Journal of Formal Logic 64 (1):1-14.
Undecidability of Algebras of Binary Relations.Robin Hirsch, Ian Hodkinson & Marcel Jackson - 2021 - In Judit Madarász & Gergely Székely (eds.), Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 267-287.

Analytics

Added to PP
2013-11-23

Downloads
93 (#225,942)

6 months
2 (#1,685,557)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Valentina Harizanov
George Washington University

Citations of this work

Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
2004 Annual Meeting of the Association for Symbolic Logic.Sergei Artemov - 2005 - Bulletin of Symbolic Logic 11 (1):92-119.

Add more citations

References found in this work

No references found.

Add more references