Triple construction of semilattices with admitting neutral -closure operators
Triple Constructions of Decomposable MS-Algebras
A simple triple construction of principal MS-algebras is given which is parallel to the construction of principal -algebras from principal triples presented by the third author in [Haviar, M.: Construction and affine completeness of principal p-algebras Tatra Mountains Math. 5 (1995), 217–228.]. It is shown that there exists a one-to-one correspondence between principal MS-algebras and principal MS-triples. Further, a triple construction of a class of decomposable MS-algebras that includes the...
Trois propriétés des médianes dans un treillis modulaire
Truth filters in De Morgan lattices.
T-topologies on a lattice ordered group.
In this paper a characterization of the topologies on a l-group arising from a CTRO (T-topologies) is given. We use it to find conditions under which the Redfield topology comes from a CTRO.
Two analogues of a classical sequence.
Two Axiomatizations of Nelson Algebras
Nelson algebras were first studied by Rasiowa and Białynicki- Birula [1] under the name N-lattices or quasi-pseudo-Boolean algebras. Later, in investigations by Monteiro and Brignole [3, 4], and [2] the name “Nelson algebras” was adopted - which is now commonly used to show the correspondence with Nelson’s paper [14] on constructive logic with strong negation. By a Nelson algebra we mean an abstract algebra 〈L, T, -, ¬, →, ⇒, ⊔, ⊓〉 where L is the carrier, − is a quasi-complementation (Rasiowa used...
Two closure operators which preserve m-compacticity
Two Congruence Lattices of Completely Simple Semigroups.
Two constructions of compatible relations
Two constructions of De Morgan algebras and De Morgan quasirings
De Morgan quasirings are connected to De Morgan algebras in the same way as Boolean rings are connected to Boolean algebras. The aim of the paper is to establish a common axiom system for both De Morgan quasirings and De Morgan algebras and to show how an interval of a De Morgan algebra (or De Morgan quasiring) can be viewed as a De Morgan algebra (or De Morgan quasiring, respectively).
Two elementary commutativity theorems for generalized Boolean rings.
Two extension theorems. Modular functions on complemented lattices
We prove an extension theorem for modular functions on arbitrary lattices and an extension theorem for measures on orthomodular lattices. The first is used to obtain a representation of modular vector-valued functions defined on complemented lattices by measures on Boolean algebras. With the aid of this representation theorem we transfer control measure theorems, Vitali-Hahn-Saks and Nikodým theorems and the Liapunoff theorem about the range of measures to the setting of modular functions on complemented...
Two Kinds of Invariance of Full Conditional Probabilities
Let G be a group acting on Ω and ℱ a G-invariant algebra of subsets of Ω. A full conditional probability on ℱ is a function P: ℱ × (ℱ∖{∅}) → [0,1] satisfying the obvious axioms (with only finite additivity). It is weakly G-invariant provided that P(gA|gB) = P(A|B) for all g ∈ G and A,B ∈ ℱ, and strongly G-invariant provided that P(gA|B) = P(A|B) whenever g ∈ G and A ∪ gA ⊆ B. Armstrong (1989) claimed that weak and strong invariance are equivalent, but we shall show that this is false and that weak...
Two new criteria for comparison in the Bruhat order.
Two Poset Polytopes.
Two properties of free Boolean algebras
Two remarks on dually residuated lattice ordered semigroups
Two results on a partial ordering of finite sequences
In the first part of the paper we are concerned about finite sequences (over arbitrary symbols) for which . The function measures the maximum length of finite sequences over symbols which contain no subsequence of the type . It follows from the result of Hart and Sharir that the containment is a (minimal) obstacle to . We show by means of a construction due to Sharir and Wiernik that there is another obstacle to the linear growth. In the second part of the paper we investigate whether...
Two theorems of functional analysis effectively equivalent to choice axioms