Difference sets and computability theory

Annals of Pure and Applied Logic 93 (1-3):63-72 (1998)
  Copy   BIBTEX

Abstract

For a set A of non-negative integers, let D be the set of non-negative differences of elements of A. Clearly, if A is computable, then D is computably enumerable. We show that every simple set which contains 0 is the difference set of some computable set and that every computably enumerable set is computably isomorphic to the difference set of some computable set. Also, we prove that there is a computable set which is the difference set of the complement of some computably enumerable set but not of any computably enumerable set. Finally, we show that every arithmetic set is in the Boolean algebra generated from the computable sets by the difference operator D and the Boolean operations

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

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

Through your library

Similar books and articles

Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computability of Self‐Similar Sets.Hiroyasu Kamo & Kiko Kawamura - 1999 - Mathematical Logic Quarterly 45 (1):23-30.
Computability on Regular Subsets of Euclidean Space.Martin Ziegler - 2002 - Mathematical Logic Quarterly 48 (S1):157-181.
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability of measurable sets via effective metrics.Yongcheng Wu & Decheng Ding - 2005 - Mathematical Logic Quarterly 51 (6):543-559.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Difference Sets and Recursion Theory.James H. Schmerl - 1998 - Mathematical Logic Quarterly 44 (4):515-521.
Dynamic properties of computably enumerable sets.Robert I. Soare - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 224--105.

Analytics

Added to PP
2014-01-16

Downloads
11 (#1,131,486)

6 months
3 (#962,966)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
What's the difference?James H. Schmerl - 1998 - Annals of Pure and Applied Logic 93 (1-3):255-261.

Add more references