Difference sets and computability theory

Rod Downey, Zoltán Füredi, Carl G. Jockusch, Lee A. Rubel

Research output: Contribution to journalArticle

Abstract

For a set A of non-negative integers, let D(A) (the difference set of A) be the set of non-negative differences of elements of A. Clearly, if A is computable, then D(A) is computably enumerable. We show (as partial converses) 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.

Original languageEnglish
Pages (from-to)63-72
Number of pages10
JournalAnnals of Pure and Applied Logic
Volume93
Issue number1-3
DOIs
Publication statusPublished - Apr 28 1998

Keywords

  • Computably enumerable
  • Difference set

ASJC Scopus subject areas

  • Logic

Fingerprint Dive into the research topics of 'Difference sets and computability theory'. Together they form a unique fingerprint.

  • Cite this