AbstractIn the lattice of subalgebras of a Boolean algebra D call Ba complement of A if A ∩ B = {0,1} and {A ∪ B} generates D. B is called a quasicomplement of A if it is maximal w.r.t. the property A ∩ B = {0, 1}. We characterize those countable subalgebras of P(ω) which have a complement, and, assuming Martin's Axiom, describe the isomorphism types of some quasicomplements of the finite-cofinite subalgebra of P(ω)
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by pr...
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by pr...
AbstractIn the lattice of subalgebras of a Boolean algebra D call Ba complement of A if A ∩ B = {0,1...
AbstractShafaat showed that if L(Q(A)) is the lattice of subquasivarieties of the quasivariety Q(A) ...
AbstractShafaat showed that if L(Q(A)) is the lattice of subquasivarieties of the quasivariety Q(A) ...
This book discusses the ways in which the algebras in a locally finite quasivariety determine its la...
summary:For a subalgebra ${\mathcal B}$ of a partial monounary algebra ${\mathcal A}$ we define the ...
For a monounary algebra A = (A, f) we study the lattice QuordA of all quasiorders of A, i.e., of all...
AbstractTheorem A⋄ℵ1There is a Boolean algebra B with the following properties:(1)B is thin–tall, an...
summary:We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous ...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
summary:We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous ...
summary:We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous ...
In this paper, the concept of quasi pseudo-complementation on an Almost Distributive Lattice (ADL) a...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by pr...
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by pr...
AbstractIn the lattice of subalgebras of a Boolean algebra D call Ba complement of A if A ∩ B = {0,1...
AbstractShafaat showed that if L(Q(A)) is the lattice of subquasivarieties of the quasivariety Q(A) ...
AbstractShafaat showed that if L(Q(A)) is the lattice of subquasivarieties of the quasivariety Q(A) ...
This book discusses the ways in which the algebras in a locally finite quasivariety determine its la...
summary:For a subalgebra ${\mathcal B}$ of a partial monounary algebra ${\mathcal A}$ we define the ...
For a monounary algebra A = (A, f) we study the lattice QuordA of all quasiorders of A, i.e., of all...
AbstractTheorem A⋄ℵ1There is a Boolean algebra B with the following properties:(1)B is thin–tall, an...
summary:We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous ...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
summary:We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous ...
summary:We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous ...
In this paper, the concept of quasi pseudo-complementation on an Almost Distributive Lattice (ADL) a...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by pr...
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by pr...