Uniform regular enumerations

DOI10.1017/S0960129506005639zbMath1128.03035OpenAlexW2086265787MaRDI QIDQ3422026

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

generalized computabilityenumeration reducibilityuniform 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)

Related Items (7)

Unnamed Item ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees ⋮ 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 ⋮ The jump operator on the \(\omega \)-enumeration degrees

This page was built for publication: Uniform regular enumerations