Relative completeness of arithmetical numberings

DOI10.1017/S0960129526100541MaRDI QIDQ7228356zbMATH OpenFDO

Authors Marat Kh. Faizrahmanov

Publication date 14 April 2026

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

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

zbMATH Keywords

arithmetical numberingcomplete numberingprecomplete numberingprincipal numbering

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Complete numerations with infinitely many singular elements
• Completely enumerated sets
• Creative sets
• Fixed point theorems in computability theory
• Fixpoints and relative precompleteness
• Generalized computable numerations and nontrivial Rogers semilattices
• Generalized computable universal numberings
• Gödel numberings of partial recursive functions
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 3260769 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Index sets of quotient objects of the Post numeration
• Isomorphism of systems of recursively enumerable sets with effective properties
• Non-collapse of the effective wadge hierarchy
• Numberings, c.e. oracles, and fixed points
• On inseparable pairs
• Precomplete numberings
• Some independence results for control structures in complete numberings
• Some remarks on completions of numberings
• STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
• Subfamilies of special elements of complete numberings
• Theorie der Numerierungen I
• Theory of Formal Systems. (AM-47)
• Turing computability. Theory and applications

This page was built for publication: Relative completeness of arithmetical numberings

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