Orthomodular lattices and closure operations in ordered vector spaces

Jan Florek

Displaying similar documents to “Orthomodular lattices and closure operations in ordered vector spaces”

A class of multiplicative lattices

Tiberiu Dumitrescu, Mihai Epure (2021)

Czechoslovak Mathematical Journal

Similarity:

We study the multiplicative lattices $L$ which satisfy the condition $a = (a : (a : b)) (a : b)$ for all $a, b \in L$ . Call them sharp lattices. We prove that every totally ordered sharp lattice is isomorphic to the ideal lattice of a valuation domain with value group $ℤ$ or $ℝ$ . A sharp lattice $L$ localized at its maximal elements are totally ordered sharp lattices. The converse is true if $L$ has finite character.

An extension method for t-norms on subintervals to t-norms on bounded lattices

Funda Karaçal, Ümit Ertuğrul, M. Nesibe Kesicioğlu (2019)

Kybernetika

Similarity:

In this paper, a construction method on a bounded lattice obtained from a given t-norm on a subinterval of the bounded lattice is presented. The supremum distributivity of the constructed t-norm by the mentioned method is investigated under some special conditions. It is shown by an example that the extended t-norm on $L$ from the t-norm on a subinterval of $L$ need not be a supremum-distributive t-norm. Moreover, some relationships between the mentioned construction method and the other...

On covariety lattices

Tomasz Brengos (2008)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

This paper shows basic properties of covariety lattices. Such lattices are shown to be infinitely distributive. The covariety lattice $L_{C V} (K)$ of subcovarieties of a covariety K of F-coalgebras, where F:Set → Set preserves arbitrary intersections is isomorphic to the lattice of subcoalgebras of a $P_{κ}$ -coalgebra for some cardinal κ. A full description of the covariety lattice of Id-coalgebras is given. For any topology τ there exist a bounded functor F:Set → Set and a covariety K of F-coalgebras,...

Hyperreflexivity of bilattices

Kamila Kliś-Garlicka (2016)

Czechoslovak Mathematical Journal

Similarity:

The notion of a bilattice was introduced by Shulman. A bilattice is a subspace analogue for a lattice. In this work the definition of hyperreflexivity for bilattices is given and studied. We give some general results concerning this notion. To a given lattice $ℒ$ we can construct the bilattice $Σ_{ℒ}$ . Similarly, having a bilattice $Σ$ we may consider the lattice $ℒ_{Σ}$ . In this paper we study the relationship between hyperreflexivity of subspace lattices and of their associated bilattices. Some examples...

Every lattice is embeddable in the lattice of $T_{1}$ -topologies

Richard Valent (1973)

Colloquium Mathematicae

Similarity:

Lattice-inadmissible incidence structures

Frantisek Machala, Vladimír Slezák (2004)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Join-independent and meet-independent sets in complete lattices were defined in [6]. According to [6], to each complete lattice (L,≤) and a cardinal number p one can assign (in a unique way) an incidence structure $J_{L}^{p}$ of independent sets of (L,≤). In this paper some lattice-inadmissible incidence structures are founded, i.e. such incidence structures that are not isomorphic to any incidence structure $J_{L}^{p}$ .

On the special context of independent sets

Vladimír Slezák (2001)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

In this paper the context of independent sets $J_{L}^{p}$ is assigned to the complete lattice (P(M),⊆) of all subsets of a non-empty set M. Some properties of this context, especially the irreducibility and the span, are investigated.

Chromatic number of the product of graphs, graph homomorphisms, antichains and cofinal subsets of posets without AC

Amitayu Banerjee, Zalán Gyenis (2021)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In set theory without the axiom of choice (AC), we observe new relations of the following statements with weak choice principles. $\circ$ If in a partially ordered set, all chains are finite and all antichains are countable, then the set is countable. $\circ$ If in a partially ordered set, all chains are finite and all antichains have size $ℵ_{α}$ , then the set has size $ℵ_{α}$ for any regular $ℵ_{α}$ . $\circ$ Every partially ordered set without a maximal element has two disjoint cofinal sub sets – CS. $\circ$ Every partially...

On central atoms of Archimedean atomic lattice effect algebras

Martin Kalina (2010)

Kybernetika

Similarity:

If element $z$ of a lattice effect algebra $(E, \oplus, 0, 1)$ is central, then the interval $[0, z]$ is a lattice effect algebra with the new top element $z$ and with inherited partial binary operation $\oplus$ . It is a known fact that if the set $C (E)$ of central elements of $E$ is an atomic Boolean algebra and the supremum of all atoms of $C (E)$ in $E$ equals to the top element of $E$ , then $E$ is isomorphic to a direct product of irreducible effect algebras ([16]). In [10] Paseka and Riečanová published as open problem whether $C (E)$ is...

Reducing the lengths of slim planar semimodular lattices without changing their congruence lattices

Gábor Czédli (2024)

Mathematica Bohemica

Similarity:

Following G. Grätzer and E. Knapp (2007), a slim planar semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_{3}$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly irreducible elements and these two elements are complements of each other. A finite poset $P$ is said to be JConSPS-representable if there is an SPS lattice $L$ such that $P$ is isomorphic to the poset $J (Con L)$ of join-irreducible congruences of $L$ . We prove that...

Some methods to obtain t-norms and t-conorms on bounded lattices

Gül Deniz Çaylı (2019)

Kybernetika

Similarity:

In this study, we introduce new methods for constructing t-norms and t-conorms on a bounded lattice $L$ based on a priori given t-norm acting on $[a, 1]$ and t-conorm acting on $[0, a]$ for an arbitrary element $a \in L ∖ {0, 1}$ . We provide an illustrative example to show that our construction methods differ from the known approaches and investigate the relationship between them. Furthermore, these methods are generalized by iteration to an ordinal sum construction for t-norms and t-conorms on a bounded lattice. ...