Add to ORKGThe paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite lattice properties. As a result finite lattices, repsesented in the kind of subsemilattice lattices, have been described as well as sublamilattice finite lattice sublattices as from belov lattices, bounded from below in accuracy. The characterization in terms of non-embeddability of subsemilattice upper half-distributive (co-algebraic) lattices has been givenAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
Every distributive lattice D can be seen as a sublattice of a hyperfinite lattice. This simple and u...
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find ...
For an algebraic structure A, let SubA denote the substructure lattice of A. For a class K of algebr...
International audienceVarious embedding problems of lattices into complete lattices are solved. We p...
We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and on...
Paper arXiv id : math/0501364For a class C of finite lattices, the question arises whether any latti...
summary:This paper presents an elementary proof and a generalization of a theorem due to Abramovich ...
For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embed...
AbstractSets of subsemilattices of semilattices are given a natural meet-distributive bisemilattice ...
The covering relation in the lattice of subuniverses of a finite distributive lattice is characteriz...
This is an introductory survey of substructural logics and of residuated lattices which are algebrai...
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interva...
The convex subsemilattices of a semilattice E form a lattice Co(E) in the natural way. The purpose o...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
Every distributive lattice D can be seen as a sublattice of a hyperfinite lattice. This simple and u...
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find ...
For an algebraic structure A, let SubA denote the substructure lattice of A. For a class K of algebr...
International audienceVarious embedding problems of lattices into complete lattices are solved. We p...
We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and on...
Paper arXiv id : math/0501364For a class C of finite lattices, the question arises whether any latti...
summary:This paper presents an elementary proof and a generalization of a theorem due to Abramovich ...
For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embed...
AbstractSets of subsemilattices of semilattices are given a natural meet-distributive bisemilattice ...
The covering relation in the lattice of subuniverses of a finite distributive lattice is characteriz...
This is an introductory survey of substructural logics and of residuated lattices which are algebrai...
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interva...
The convex subsemilattices of a semilattice E form a lattice Co(E) in the natural way. The purpose o...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
Every distributive lattice D can be seen as a sublattice of a hyperfinite lattice. This simple and u...
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find ...