Displaying similar documents to “Archimedean atomic lattice effect algebras with complete lattice of sharp elements.”

On the lattice of deductive systems of a BL-algebra

Dumitru Bu§neag, Dana Piciu (2003)

Open Mathematics

Similarity:

For a BL-algebra A we denote by Ds(A) the lattice of all deductive systems of A. The aim of this paper is to put in evidence new characterizations for the meet-irreducible elements on Ds(A). Hyperarchimedean BL-algebras, too, are characterized.

Almost orthogonality and Hausdorff interval topologies of atomic lattice effect algebras

Jan Paseka, Zdena Riečanová, Junde Wu (2010)

Kybernetika

Similarity:

We prove that the interval topology of an Archimedean atomic lattice effect algebra E is Hausdorff whenever the set of all atoms of E is almost orthogonal. In such a case E is order continuous. If moreover E is complete then order convergence of nets of elements of E is topological and hence it coincides with convergence in the order topology and this topology is compact Hausdorff compatible with a uniformity induced by a separating function family on E corresponding to compact and cocompact...

Orthomodular Lattices

Elżbieta Mądra, Adam Grabowski (2008)

Formalized Mathematics

Similarity:

The main result of the article is the solution to the problem of short axiomatizations of orthomodular ortholattices. Based on EQP/Otter results [10], we gave a set of three equations which is equivalent to the classical, much longer equational basis of such a class. Also the basic example of the lattice which is not orthomodular, i.e. benzene (or B6) is defined in two settings - as a relational structure (poset) and as a lattice.As a preliminary work, we present the proofs of the dependence...

Formalization of Integral Linear Space

Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2011)

Formalized Mathematics

Similarity:

In this article, we formalize integral linear spaces, that is a linear space with integer coefficients. Integral linear spaces are necessary for lattice problems, LLL (Lenstra-Lenstra-Lovász) base reduction algorithm that outputs short lattice base and cryptographic systems with lattice [8].