All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 13 Next

Displaying 241 – 260 of 3879

Showing per page

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,...

Additive closure operators on abelian unital l -groups

Filip Švrček (2006)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

In the paper an additive closure operator on an abelian unital l -group ( G , u ) is introduced and one studies the mutual relation of such operators and of additive closure ones on the M V -algebra Γ ( G , u ) .

Adjoint Semilattice and Minimal Brouwerian Extensions of a Hilbert Algebra

Jānis Cīrulis (2012)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Let A : = ( A , → , 1 ) be a Hilbert algebra. The monoid of all unary operations on A generated by operations α p : x ↦ ( p → x ) , which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of A . This semilattice is isomorphic to the semilattice of finitely generated filters of A , it is subtractive (i.e., dually implicative), and its ideal lattice is isomorphic to the filter lattice of A . Moreover, the order dual of the adjoint semilattice is a minimal Brouwerian extension of A , and the...

Currently displaying 241 – 260 of 3879