✦ LIBER ✦

On Orbits of Prompt and Low Computably Enumerable Sets

✍ Scribed by Kevin Wald

Book ID: 124191395
Publisher: Association for Symbolic Logic
Year: 2002
Tongue: English
Weight: 589 KB
Volume: 67
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2694944

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orbits of computably enumerable sets: lo

Orbits of computably enumerable sets: low sets can avoid an upper cone

✍ Russell Miller 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 222 KB

We investigate the orbit of a low computably enumerable (c.e.) set under automorphisms of the partial order E of c.e. sets under inclusion. Given an arbitrary low c.e. set A and an arbitrary noncomputable c.e. set C, we use the New Extension Theorem of Soare to construct an automorphism of E mapping

Differences of Computably Enumerable Set

Differences of Computably Enumerable Sets

✍ Steffen Lempp; André Nies 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Isomorphisms of Splits of Computably Enu

Isomorphisms of Splits of Computably Enumerable Sets

✍ Peter A. Cholak and Leo A. Harrington 📂 Article 📅 2003 🏛 Association for Symbolic Logic 🌐 English ⚖ 577 KB

Decomposability of low 2-computably enum

Decomposability of low 2-computably enumerable degrees and turing jumps in the Ershov hierarchy

✍ M. Kh. Faizrakhmanov 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 538 KB

On Complexity Properties of Recursively

On Complexity Properties of Recursively Enumerable Sets

✍ M. Blum and I. Marques 📂 Article 📅 1973 🏛 Association for Symbolic Logic 🌐 English ⚖ 410 KB

Computer construction and enumeration of

Computer construction and enumeration of topologies on finite sets

✍ Farrag, A. S.; Sewisy, Adel A. 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 304 KB