Page 1 Next

Displaying 1 – 20 of 25

Showing per page

Some characterizations of completeness for trellises in terms of joins of cycles

S. Parameshwara Bhatta, H. Shashirekha (2004)

Czechoslovak Mathematical Journal

This paper gives some new characterizations of completeness for trellises by introducing the notion of a cycle-complete trellis. One of our results yields, in particular, a characterization of completeness for trellises of finite length due to K. Gladstien (see K. Gladstien: Characterization of completeness for trellises of finite length, Algebra Universalis 3 (1973), 341–344).

Some properties of Eulerian lattices

R. Subbarayan, A. Vethamanickam (2014)

Commentationes Mathematicae Universitatis Carolinae

In this paper, we prove that Eulerian lattices satisfying some weaker conditions for lattices or some weaker conditions for 0-distributive lattices become Boolean.

Stone Lattices

Adam Grabowski (2015)

Formalized Mathematics

The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the other which...

Currently displaying 1 – 20 of 25

Page 1 Next