On computable numberings of families of Turing degrees
From MaRDI portal
Publication:6565569
Cites work
- scientific article; zbMATH DE number 412149 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3995654 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- scientific article; zbMATH DE number 3260769 (Why is no real title available?)
- A survey on universal computably enumerable equivalence relations
- Completely enumerated sets
- Computable single-valued numerations
- Creative sets
- Enumerations in computable structure theory
- Extremal numberings and fixed point theorems
- Fixed-point selection functions
- Generalized computable numerations and nontrivial Rogers semilattices
- Gödel numberings of partial recursive functions
- Inductive inference and computable numberings
- Numberings, c.e. oracles, and fixed points
- On inseparable pairs
- On the Degrees of Index Sets
- On the cardinality of the upper semilattice of computable enumerations
- Partial combinatory algebra and generalized numberings
- Some independence results for control structures in complete numberings
- Some remarks on completions of numberings
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- Two theorems on computable numberings
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)