Discrete families of recursive functions and index sets

DOI10.1007/BF00739994zbMath0828.03014OpenAlexW2011107619MaRDI QIDQ1842381

Yanyan Li

Publication date: 17 May 1995

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00739994

zbMATH Keywords

semilatticeindex setscomputable numberingtotal recursive functionspartial recursive functionscomputable familydiscrete class

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03

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

This page was built for publication: Discrete families of recursive functions and index sets