Enumerations of families of general recursive functions

DOI10.1007/BF01877237zbMath0358.02051OpenAlexW2022832716MaRDI QIDQ1239156

Victor L. Selivanov

Publication date: 1977

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01877237

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Related Items

There is no classification of the decidably presentable structures ⋮ Preserving categoricity and complexity of relations ⋮ On universal pairs in the Ershov hierarchy ⋮ Computability-theoretic categoricity and Scott families ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Stability among r.e. quotient algebras ⋮ Effective categoricity of equivalence structures ⋮ A computably stable structure with no Scott family of finitary formulas ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Some applications of computable one-one numberings ⋮ Effective categoricity of abelian \(p\)-groups ⋮ Learning languages and functions by erasing ⋮ Enumerations in computable structure theory ⋮ Learning by the process of elimination

Cites Work

• Unnamed Item
• On computable enumerations. I
• On the indexing of classes of recursively enumerable sets
• Strong enumeration properties of recursively enumerable classes