Discrete families of recursive functions and index sets
From MaRDI portal
Publication:1842381
DOI10.1007/BF00739994zbMath0828.03014MaRDI QIDQ1842381
Publication date: 17 May 1995
Published in: Algebra and Logic (Search for Journal in Brave)
semilattice; index sets; computable numbering; total recursive functions; partial recursive functions; computable family; discrete class
03D20: Recursive functions and relations, subrecursive hierarchies
03D45: Theory of numerations, effectively presented structures
Related Items
2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03, A learning-theoretic characterization of classes of recursive functions, Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
Cites Work
- Inductive Inference and Computable One‐One Numberings
- Hyperarithmetical Index Sets in Recursion Theory
- Theorie der Numerierungen I
- A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
- The Family of all Recursively Enumerable Classes of Finite Sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item