Rogers semilattices of punctual numberings

DOI10.1017/S0960129522000093OpenAlexW4220772554MaRDI QIDQ5048010FDOQ5048010

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

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

zbMATH Keywords

decidabilityonline computationupper semilatticeprimitive recursionRogers semilatticepunctual structuretheory of numberingsfriedberg numbering

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

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