scientific article; zbMATH DE number 1390016
From MaRDI portal
Publication:4934281
zbMath0947.03061MaRDI QIDQ4934281
Publication date: 7 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (3)
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Cellular automata and intermediate degrees. ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
This page was built for publication:
