Recursively Enumerable Sets and Retracing Functions
From MaRDI portal
Publication:3848192
DOI10.1002/malq.19620080313zbMath0111.00904OpenAlexW2093546192MaRDI QIDQ3848192
Publication date: 1962
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19620080313
Related Items (27)
Uniformly introreducible sets ⋮ The degrees of hyperhyperimmune sets ⋮ A class of recursively enumerable sets ⋮ On multiple positive reducibility ⋮ Simplicity of recursively enumerable sets ⋮ A remark on the length problem ⋮ On the Degrees of Index Sets ⋮ Unnamed Item ⋮ Deficiency Sets and Bounded Information Reducibilities ⋮ Two Theorems on Hyperhypersimple Sets ⋮ Co-immune retraceable sets ⋮ Three theorems on tt-degrees ⋮ On the Lattice of Recursively Enumerable Sets ⋮ Hyperhypersimple sets and Q1 -reducibility ⋮ Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets ⋮ Semirecursive Sets and Positive Reducibility ⋮ Almost semirecursive sets ⋮ The Family of all Recursively Enumerable Classes of Finite Sets ⋮ Densely simple sets with retraceable complements ⋮ Computably enumerable sets and related issues ⋮ Countable thin \(\Pi^0_1\) classes ⋮ tt- and m-degrees ⋮ Recursively enumerable sets and degrees ⋮ Almost Recursively Enumerable Sets ⋮ Remarks on retracable, regressive, and pointwise-decomposable sets ⋮ Hypersimple sets with retraceable complements ⋮ Relations between reducibilities of table type
This page was built for publication: Recursively Enumerable Sets and Retracing Functions
