scientific article; zbMATH DE number 7763258

DOI10.33048/mattrudy.2022.25.108MaRDI QIDQ6086231

Unnamed Author

Publication date: 9 November 2023

Full work available at URL: http://mathnet.ru/eng/mt665

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computable numberingnumberingRogers semilatticeuniversal numberingcomputable family\( \Sigma_n^0\)-computable family\( \Sigma_n^0\)-computable numberingcomputable class of families

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Reducibility on families
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Universal computable enumerations of finite classes of families of total functions
• The enumeration spectrum hierarchy ofn-families
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
• Local structure of Rogers semilattices of Σn 0-computable numberings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: