Recursion theorems in numbered sets

DOI10.1142/S0129054125500248MaRDI QIDQ7317080zbMATH OpenFDO

Authors Marat Kh. Faizrahmanov

Publication date 21 August 2026

Published in (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054125500248

Mathematics Subject Classification ID

No records found.

Cites work

• Degrees in Which the Recursive Sets are Uniformly Recursive
• Effective extendability and fixed-points
• Extremal numberings and fixed point theorems
• Fixed point theorems for minimal numberings
• Fixed point theorems for precomplete numberings
• Fixed-point selection functions
• Fixpoints and relative precompleteness
• scientific article; zbMATH DE number 3827843 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (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?)
• Index sets of quotient objects of the Post numeration
• Numberings, c.e. oracles, and fixed points
• On inseparable pairs
• On notation for ordinal numbers
• On weakly pre-complete positive equivalences
• Precomplete numberings
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III

This page was built for publication: Recursion theorems in numbered sets

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