On decidability of one class of boolean formulas
On Equational Classes of Algebraic Versions of Logic I.
On fields and ideals connected with notions of forcing
We investigate an algebraic notion of decidability which allows a uniform investigation of a large class of notions of forcing. Among other things, we show how to build σ-fields of sets connected with Laver and Miller notions of forcing and we show that these σ-fields are closed under the Suslin operation.
On free Boolean vectors.
On ideals in De Morgan residuated lattices
In this paper, we introduce a new class of residuated lattices called De Morgan residuated lattices, we show that the variety of De Morgan residuated lattices includes important subvarieties of residuated lattices such as Boolean algebras, MV-algebras, BL-algebras, Stonean residuated lattices, MTL-algebras and involution residuated lattices. We investigate specific properties of ideals in De Morgan residuated lattices, we state the prime ideal theorem and the pseudo-complementedness of the ideal...
On mixed product of Boolean algebras
On Reproductive Solutions Of Arbitrary Equations
On reproductive solutions of arbitrary equations.
On some inexact relations in probabilized Boolean algebras.
This paper is devoted to characterize monotonicity, conditionality and transitivity of some rational relations defined in a probabilized Boolean Algebra.
On some properties of Post algebras with countable chain of constants
On Some Relations in Boolean Algebras
On the Boolean structure generated by -points of
On the elementary theory of inductive order.
On the range of a Boolean transformation.
On The Range Of Boolean Transformation
On the representation of S5 algebras and their automorphism groups.
Outer measure on boolean algebras
Polarity compatible with a closure system
Predicates and measures on Boolean σ-algebras
Prime ideal theorem for double Boolean algebras
Double Boolean algebras are algebras (D,⊓,⊔,⊲,⊳,⊥,⊤) of type (2,2,1,1,0,0). They have been introduced to capture the equational theory of the algebra of protoconcepts. A filter (resp. an ideal) of a double Boolean algebra D is an upper set F (resp. down set I) closed under ⊓ (resp. ⊔). A filter F is called primary if F ≠ ∅ and for all x ∈ D we have x ∈ F or . In this note we prove that if F is a filter and I an ideal such that F ∩ I = ∅ then there is a primary filter G containing F such that G...