scientific article; zbMATH DE number 6295831

zbMath1294.03004MaRDI QIDQ5417040

Thorsten Kräling

Publication date: 15 May 2014

Full work available at URL: http://archiv.ub.uni-heidelberg.de/volltextserver/16720/1/thesis.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

joinsmeetselementary equivalencecomputably enumerable setscomputable Lipschitz reducibilitycuppable degreesdegree structuresidentity-bounded Turing reducibility

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10) Other Turing degree structures (03D28)

Related Items (1)

Maximal pairs of computably enumerable sets in the computably Lipschitz degrees

This page was built for publication: