EuDML | Browse

Page 1

Displaying 1 – 4 of 4

Classes of fuzzy filters of residuated lattice ordered monoids

Jiří Rachůnek, Dana Šalounová (2010)

Mathematica Bohemica

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (monoids) are common generalizations of $BL$ -algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain information, sets of provable formulas in inference systems could be described by fuzzy filters of the corresponding...

Combinatorial trees in Priestley spaces

Richard N. Ball, Aleš Pultr, Jiří Sichler (2005)

Commentationes Mathematicae Universitatis Carolinae

We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting $n$ -crowns with $n \geq 3$ does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.

Conditions under which the least compactification of a regular continuous frame is perfect

Dharmanand Baboolal (2012)

Czechoslovak Mathematical Journal

We characterize those regular continuous frames for which the least compactification is a perfect compactification. Perfect compactifications are those compactifications of frames for which the right adjoint of the compactification map preserves disjoint binary joins. Essential to our characterization is the construction of the frame analog of the two-point compactification of a locally compact Hausdorff space, and the concept of remainder in a frame compactification. Indeed, one of the characterizations...

Correction to the paper: A new look at pointfree metrization theorems

Bernhard Banaschewski, Aleš Pultr (1998)