scientific article; zbMATH DE number 3827843
From MaRDI portal
Publication:3674634
zbMATH Open0523.03029MaRDI QIDQ3674634FDOQ3674634
Authors: M. M. Arslanov 
Publication date: 1981
Title of this publication is not available (Why is that?)
Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (23)
- Lowness for isomorphism, countable ideals, and computable traceability
- INTRINSIC SMALLNESS
- On the computability of ordered fields
- Another note on the join property
- Extremal numberings and fixed point theorems
- Numberings, c.e. oracles, and fixed points
- Partial combinatory algebra and generalized numberings
- Precomplete numberings
- Fixed point theorems for precomplete numberings
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
- Marat Mirzaevich Arslanov (on his eightieth birthday)
- Fixpoints and relative precompleteness
- Completeness criteria for a class of reducibilities
- Subspaces of computable vector spaces
- Some properties of precompletely and positively numbered sets
- The noneffectivity of Arslanov's completeness criterion and related theorems
- GENERALIZATIONS OF THE RECURSION THEOREM
- On the number of infinite sequences with trivial initial segment complexity
- When van Lambalgen’s Theorem fails
- On a general method of constructing post reducibilities and the corresponding completeness criteria
- Three theorems on \(n\)-REA degrees: proof-readers and verifiers
- Demuth randomness and computational complexity
- Independence, relative randomness, and PA degrees
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)
