Uniform regular enumerations

DOI10.1017/S0960129506005639MaRDI QIDQ3422026zbMATH OpenOpenAlexFDO

Authors Ivan N. Soskov, Bogomil Kovachev

Publication date 9 February 2007

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129506005639

zbMATH Keywords

enumeration reducibilitygeneralized computabilityuniform operatoruniform reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Regular enumerations
• The  -Enumeration Degrees
• On regressive enumerations
• On recursive enumerability with finite repetitions
• Toward a Theory of Enumerations

Cited in

(11)

• The jump operator on the \(\omega \)-enumeration degrees
• Generalizations of enumeration reducibility using recursive infinitary propositional sentences
• The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
• Enumeration reducibility and computable structure theory
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Definability in the local theory of the -enumeration degrees
• 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
• Regular enumerations
• scientific article; zbMATH DE number 7360060 (Why is no real title available?)
• scientific article; zbMATH DE number 5274220 (Why is no real title available?)
• Ivan Soskov: a life in computability

This page was built for publication: Uniform regular enumerations

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