Recursively Enumerable Sets and Retracing Functions

DOI10.1002/MALQ.19620080313MaRDI QIDQ3848192zbMATH OpenOpenAlexFDO

Authors C. E. M. Yates

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

zbMATH Keywords

mathematical logic

Cited in

(28)

• A class of recursively enumerable sets
• A remark on the length problem
• Three theorems on tt-degrees
• Densely simple sets with retraceable complements
• Countable thin ^0_1 classes
• tt- and m-degrees
• On multiple positive reducibility
• Almost semirecursive sets
• Remarks on retracable, regressive, and pointwise-decomposable sets
• Hypersimple sets with retraceable complements
• Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
• Deficiency Sets and Bounded Information Reducibilities
• Almost Recursively Enumerable Sets
• Recursively enumerable sets and degrees
• On the Lattice of Recursively Enumerable Sets
• scientific article; zbMATH DE number 7092351 (Why is no real title available?)
• On the Degrees of Index Sets
• Two Theorems on Hyperhypersimple Sets
• Uniformly introreducible sets
• The degrees of hyperhyperimmune sets
• Semirecursive Sets and Positive Reducibility
• Simplicity of recursively enumerable sets
• The Family of all Recursively Enumerable Classes of Finite Sets
• Co-immune retraceable sets
• Constructivity conditions on immune sets
• Computably enumerable sets and related issues
• Relations between reducibilities of table type
• Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets

This page was built for publication: Recursively Enumerable Sets and Retracing Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3848192)