Effectively infinite classes of numberings and fixed point theorems

DOI10.33048/SEMI.2023.20.094MaRDI QIDQ6587480zbMATH OpenFDO

Authors Marat Kh. Faizrahmanov

Publication date 14 August 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

recursion theoremcomputable numberingprecomplete numberingeffective infinitycomplete numbering

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3536064 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 3260769 (Why is no real title available?)
• Completely enumerated sets
• Computability and models. Perspectives east and west
• Effective extendability and fixed-points
• Extremal numberings and fixed point theorems
• Fixed point theorems for precomplete numberings
• Fixed-point selection functions
• Index sets of quotient objects of the Post numeration
• On inseparable pairs
• On weakly pre-complete positive equivalences
• Precomplete numberings
• Some effectively infinite classes of enumerations
• Theorie der Numerierungen I
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Turing computability. Theory and applications

This page was built for publication: Effectively infinite classes of numberings and fixed point theorems

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