On Wallman compactifications
R. Brooks (1967)
Fundamenta Mathematicae
Similarity:
R. Brooks (1967)
Fundamenta Mathematicae
Similarity:
Sándor Radeleczki (2002)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...
Henry H. Crapo (1967)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
J. L. Ericksen (1982)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Walendziak, Andrzej (1994)
Portugaliae Mathematica
Similarity:
Zhi-qiang Liu (2024)
Kybernetika
Similarity:
In this article, we investigate the algebraic structures of the partial orders induced by uninorms on a bounded lattice. For a class of uninorms with the underlying drastic product or drastic sum, we first present some conditions making a bounded lattice also a lattice with respect to the order induced by such uninorms. And then we completely characterize the distributivity of the lattices obtained.
Václav Slavík (1973)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Yuichi Futa, Yasunari Shidama (2017)
Formalized Mathematics
Similarity:
In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic...
M. Nesibe Kesicioğlu (2017)
Kybernetika
Similarity:
In this paper, an equivalence on the class of nullnorms on a bounded lattice based on the equality of the orders induced by nullnorms is introduced. The set of all incomparable elements w.r.t. the order induced by nullnorms is investigated. Finally, the recently posed open problems have been solved.
Júlia Kulin (2016)
Discussiones Mathematicae General Algebra and Applications
Similarity:
A quasiorder (relation), also known as a preorder, is a reflexive and transitive relation. The quasiorders on a set A form a complete lattice with respect to set inclusion. Assume that A is a set such that there is no inaccessible cardinal less than or equal to |A|; note that in Kuratowski's model of ZFC, all sets A satisfy this assumption. Generalizing the 1996 result of Ivan Chajda and Gábor Czéedli, also Tamás Dolgos' recent achievement, we prove that in this case the lattice of quasiorders...
Ivan Chajda, Helmut Länger (2017)
Topological Algebra and its Applications
Similarity:
We show that every idempotent weakly divisible residuated lattice satisfying the double negation law can be transformed into an orthomodular lattice. The converse holds if adjointness is replaced by conditional adjointness. Moreover, we show that every positive right residuated lattice satisfying the double negation law and two further simple identities can be converted into an orthomodular lattice. In this case, also the converse statement is true and the corresponence is nearly one-to-one. ...
Iseki, Kiyoshi (1950)
Portugaliae mathematica
Similarity: