scientific article; zbMATH DE number 2167508
From MaRDI portal
Publication:4677692
zbMath1063.03028MaRDI QIDQ4677692
Steffen Lempp, D. Reed Solomon, Sergei S. Goncharov
Publication date: 12 May 2005
Full work available at URL: https://eudml.org/doc/188006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items
Positive presentations of families relative to \(e\)-oracles ⋮ Rogers semilattices of punctual numberings ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Two theorems on minimal generalized computable numberings ⋮ Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Properties of numberings in various levels of the Ershov hierarchy ⋮ Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering ⋮ Classifications of computable structures ⋮ Effectively closed sets and enumerations ⋮ On universal pairs in the Ershov hierarchy ⋮ Positive presentations of families in relation to reducibility with respect to enumerability ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Friedberg numberings of families of partial computable functionals ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Computable numberings of families of infinite sets ⋮ Classifications of definable subsets ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ Reductions between types of numberings ⋮ Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes
This page was built for publication:
