Rogers semilattices of punctual numberings

DOI10.1017/S0960129522000093MaRDI QIDQ5048010zbMATH OpenOpenAlexFDO

Authors S. S. Ospichev, Nikolay Bazhenov, Mustafa Manat

Publication date 17 November 2022

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129522000093

zbMATH Keywords

decidabilityonline computationupper semilatticeprimitive recursionRogers semilatticepunctual structuretheory of numberingsfriedberg numbering

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Semilattices of punctual numberings
• Theories of Rogers semilattices of analytical numberings
• Bounded reducibility for computable numberings
• Local structure of Rogers semilattices of Σn 0-computable numberings
• Rogers semilattices of limitwise monotonic numberings

Cites work

• scientific article; zbMATH DE number 3536064 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• scientific article; zbMATH DE number 1531919 (Why is no real title available?)
• scientific article; zbMATH DE number 2167508 (Why is no real title available?)
• scientific article; zbMATH DE number 3805536 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 7407778 (Why is no real title available?)
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Algebraic structures computable without delay
• Arithmetical m-degrees
• Computability and numberings
• Computable numberings of families of infinite sets
• Elementary theories and hereditary undecidability for semilattices of numberings
• Eliminating unbounded search in computable algebra
• Enumeration of families of general recursive functions
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Friedberg numberings in the Ershov hierarchy
• Generalized computable numerations and nontrivial Rogers semilattices
• Graphs are not universal for online computability
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Numberings in the analytical hierarchy
• On the cardinality of the upper semilattice of computable enumerations
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Reductions between types of numberings
• Semilattices of punctual numberings
• The back-and-forth method and computability without delay
• Theorie Der Numerierungen III
• Theorie der Numerierungen I
• Two theorems on computable numberings

Cited in

(1)

• Semilattices of punctual numberings

This page was built for publication: Rogers semilattices of punctual numberings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048010)