scientific article; zbMATH DE number 841094
From MaRDI portal
Publication:4863250
zbMath0849.03033MaRDI QIDQ4863250
Publication date: 4 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyBrouwer algebrasMedvedev degreesTuring degrees of unsolvabilityMedvedev latticemass problemdegrees of difficulty
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)
Related Items
The Medvedev lattice of computably closed sets ⋮ Natural factors of the Muchnik lattice capturing IPC ⋮ Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes ⋮ Intuitionistic logic and Muchnik degrees ⋮ First-order logic in the Medvedev lattice ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ Degrees of difficulty of generalized r.e. separating classes ⋮ The finite intervals of the Muchnik lattice ⋮ Natural factors of the Medvedev lattice capturing IPC ⋮ Intermediate logics and factors of the Medvedev lattice ⋮ The First Order Theories of the Medvedev and Muchnik Lattices ⋮ Computability of countable subshifts in one dimension ⋮ Medvedev Degrees of Generalized R.E. separating Classes ⋮ Constructive logic and the Medvedev lattice ⋮ Kripke models, distributive lattices, and Medvedev degrees ⋮ Highness properties close to PA completeness ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees ⋮ WEIHRAUCH GOES BROUWERIAN
