scientific article; zbMATH DE number 1531930
From MaRDI portal
Publication:4513973
zbMath0962.03035MaRDI QIDQ4513973
Publication date: 19 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
definabilitycomputably enumerable Turing degreesbiinterpretabilityuniformly computably enumerable sequences
Related Items (3)
Definability in the structure of words with the inclusion relation ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Definability in the Infix Order on Words
This page was built for publication: