The translation theorem

Archive for Mathematical Logic 33 (2):87-108 (1994)
  Copy   BIBTEX

Abstract

We state and prove the Translation Theorem. Then we apply the Translation Theorem to Soare's Extension Theorem, weakening slightly the hypothesis to yield a theorem we call the Modified Extension Theorem. We use this theorem to reprove several of the known results about orbits in the lattice of recursively enumerable sets. It is hoped that these proofs are easier to understand than the old proofs

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
Positive logics.Saharon Shelah & Jouko Väänänen - 2023 - Archive for Mathematical Logic 62 (1):207-223.
Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.

Analytics

Added to PP
2013-12-01

Downloads
48 (#340,493)

6 months
4 (#863,447)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Some orbits for E.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.
Definable properties of the computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
Some orbits for.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.

Add more citations

References found in this work

Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
Friedberg splittings of recursively enumerable sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.

Add more references