The study of mass problems and Muchnik degrees was originally motivated by Kolmogorov\u27s non-rigorous 1932 interpretation of intuitionism as a calculus of problems. The purpose of this paper is to summarize recent investigations into the lattice of Muchnik degrees of nonempty effectively closed sets in Euclidean space. Let $\mathcal{E}_\mathrm{w}$ be this lattice. We show that $\mathcal{E}_\mathrm{w}$ provides an elegant and useful framework for the classification of certain foundationally interesting problems which are algorithmically unsolvable. We exhibit some specific degrees in $\mathcal{E}_\mathrm{w}$ which are associated with such problems. In addition, we present some structural results concerning the lattice $\mathcal{E}_\mathrm{...
We revisit the visible points of a lattice in Euclidean n-space together with their generalisations,...
Simpson introduced the lattice P of 0 1 classes under Medvedev re-ducibility. Questions regarding co...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...
This paper was written in order to celebrate the centennial of the Tohoku Math-ematical Journal. It ...
We study the Medvedev degrees of mass problems with distinguished topological properties, such as de...
In this paper we study a model of intuitionistic higher-order logic which we call the Muchnik topos....
AbstractLet Es denote the lattice of Medvedev degrees of non-empty Π10 subsets of 2ω, and let Ew den...
We prove that there is a factor of the Muchnik lattice that captures intuitionistic propositional lo...
We investigate the complexity of mathematical problems from two perspectives: Medvedev degrees and r...
We investigate the complexity of mathematical problems from two perspectives: Medvedev degrees and r...
The paper provides a survey on what is known about the Medvedev lattice and the Muchnik lattice
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
We investigate the complexity of mathematical problems from two perspectives: Medvedev degrees and r...
We survey some open problems in the enumeration degrees. The problems fall into the following three ...
In the 1960’s and 1970’s, mathematicians discovered geometric patterns which displayed a high degree...
We revisit the visible points of a lattice in Euclidean n-space together with their generalisations,...
Simpson introduced the lattice P of 0 1 classes under Medvedev re-ducibility. Questions regarding co...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...
This paper was written in order to celebrate the centennial of the Tohoku Math-ematical Journal. It ...
We study the Medvedev degrees of mass problems with distinguished topological properties, such as de...
In this paper we study a model of intuitionistic higher-order logic which we call the Muchnik topos....
AbstractLet Es denote the lattice of Medvedev degrees of non-empty Π10 subsets of 2ω, and let Ew den...
We prove that there is a factor of the Muchnik lattice that captures intuitionistic propositional lo...
We investigate the complexity of mathematical problems from two perspectives: Medvedev degrees and r...
We investigate the complexity of mathematical problems from two perspectives: Medvedev degrees and r...
The paper provides a survey on what is known about the Medvedev lattice and the Muchnik lattice
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fu...
We investigate the complexity of mathematical problems from two perspectives: Medvedev degrees and r...
We survey some open problems in the enumeration degrees. The problems fall into the following three ...
In the 1960’s and 1970’s, mathematicians discovered geometric patterns which displayed a high degree...
We revisit the visible points of a lattice in Euclidean n-space together with their generalisations,...
Simpson introduced the lattice P of 0 1 classes under Medvedev re-ducibility. Questions regarding co...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...