scientific article; zbMATH DE number 3827843

MaRDI QIDQ3674634zbMATH OpenFDO

Authors M. M. Arslanov

Publication date 1981

zbMATH Keywords

fixed point theoremrecursive functionsTuring degrees

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(26)

• Precomplete numberings
• Partial combinatory algebra and generalized numberings
• Fixed point theorems for precomplete numberings
• Independence, relative randomness, and PA degrees
• Subspaces of computable vector spaces
• Completeness criteria for a class of reducibilities
• On a general method of constructing post reducibilities and the corresponding completeness criteria
• Three theorems on n-REA degrees: proof-readers and verifiers
• When van Lambalgen’s Theorem fails
• GENERALIZATIONS OF THE RECURSION THEOREM
• Computability in partial combinatory algebras
• Fixpoints and relative precompleteness
• Lowness for isomorphism, countable ideals, and computable traceability
• INTRINSIC SMALLNESS
• Another note on the join property
• Numberings, c.e. oracles, and fixed points
• Extremal numberings and fixed point theorems
• Demuth randomness and computational complexity
• On the number of infinite sequences with trivial initial segment complexity
• On the computability of ordered fields
• Marat Mirzaevich Arslanov (on his eightieth birthday)
• Some properties of precompletely and positively numbered sets
• Fixed point theorems for minimal numberings
• Fixed point theorems in computability theory
• Recursion theorems in numbered sets
• The noneffectivity of Arslanov's completeness criterion and related theorems

This page was built for publication:

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