Add to ORKGWe characterize the finite intervals of the Muchnik lattice by proving that they form a certain proper subclass of the finite distributive lattices. We also discuss infinite intervals, mainly to conclude that much more is possible here than for the related Medvedev lattice
The paper provides a survey on what is known about the Medvedev lattice and the Muchnik lattice
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
We shall investigate a certain class of finite lattices which we call supersolvable lattices (for a ...
Contains fulltext : 91467.pdf (publisher's version ) (Open Access) ...
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interva...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
Abstract Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non...
An important and long-standing open problem in universal algebra asks whether every finite lattice i...
AbstractLet Mnbe the lattice of length 2 withn≥1 atoms. It is an open problem to decide whether or n...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
AbstractAssuming the existence of infinitely many measurable cardinals, a finite lattice is isomorph...
We present several recent results on the structure of the lattice of combinatorial Rees–Sushkevich v...
Assuming the existence of infinitely many measurable cardinals, a finite lattice is isomorphic to th...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
The paper provides a survey on what is known about the Medvedev lattice and the Muchnik lattice
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
We shall investigate a certain class of finite lattices which we call supersolvable lattices (for a ...
Contains fulltext : 91467.pdf (publisher's version ) (Open Access) ...
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interva...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
Abstract Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non...
An important and long-standing open problem in universal algebra asks whether every finite lattice i...
AbstractLet Mnbe the lattice of length 2 withn≥1 atoms. It is an open problem to decide whether or n...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
AbstractAssuming the existence of infinitely many measurable cardinals, a finite lattice is isomorph...
We present several recent results on the structure of the lattice of combinatorial Rees–Sushkevich v...
Assuming the existence of infinitely many measurable cardinals, a finite lattice is isomorphic to th...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
The paper provides a survey on what is known about the Medvedev lattice and the Muchnik lattice
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
We shall investigate a certain class of finite lattices which we call supersolvable lattices (for a ...