Rogers semilattices of punctual numberings

DOI10.1017/S0960129522000093OpenAlexW4220772554MaRDI QIDQ5048010

S. S. Ospichev, Manat Mustafa, Nikolay Bazhenov

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

decidabilityprimitive recursiononline computationupper semilatticeRogers semilatticetheory of numberingspunctual structurefriedberg numbering

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic structures computable without delay
• Numberings in the analytical hierarchy
• On the cardinality of the upper semilattice of computable enumerations
• Two theorems on computable numberings
• Elementary theories and hereditary undecidability for semilattices of numberings
• Eliminating unbounded search in computable algebra
• Semilattices of punctual numberings
• Graphs are not universal for online computability
• The back-and-forth method and computability without delay
• Computable numberings of families of infinite sets
• Reductions between types of numberings
• Enumeration of families of general recursive functions
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Theorie der Numerierungen I
• Theorie Der Numerierungen III
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Friedberg numberings in the Ershov hierarchy

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