Page 1

Displaying 1 – 5 of 5

Showing per page

A finite word poset.

Erdős, Péter L., Sziklai, Péter, Torney, David C. (2001)

The Electronic Journal of Combinatorics [electronic only]

A visual approach to test lattices

Gábor Czédli (2009)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Let p be a k -ary lattice term. A k -pointed lattice L = ( L ; , , d 1 , ... , d k ) will be called a p -lattice (or a test lattice if p is not specified), if ( L ; , ) is generated by { d 1 , ... , d k } and, in addition, for any k -ary lattice term q satisfying p ( d 1 , ... , d k ) q ( d 1 , ... , d k ) in L , the lattice identity p q holds in all lattices. In an elementary visual way, we construct a finite p -lattice L ( p ) for each p . If p is a canonical lattice term,...

Currently displaying 1 – 5 of 5

Page 1