On computable numberings of families of Turing degrees
From MaRDI portal
Publication:6565569
DOI10.1007/S00153-024-00914-9MaRDI QIDQ6565569
Publication date: 2 July 2024
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computable single-valued numerations
- On the cardinality of the upper semilattice of computable enumerations
- Completely enumerated sets
- Two theorems on computable numberings
- Fixed-point selection functions
- Partial combinatory algebra and generalized numberings
- Inductive inference and computable numberings
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- On inseparable pairs
- Enumerations in computable structure theory
- Generalized computable numerations and nontrivial Rogers semilattices
- Some independence results for control structures in complete numberings
- A Survey on Universal Computably Enumerable Equivalence Relations
- Gödel numberings of partial recursive functions
- On the Degrees of Index Sets
- Creative sets
- Numberings, c.e. oracles, and fixed points
- Extremal numberings and fixed point theorems
This page was built for publication: On computable numberings of families of Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565569)
