The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 18 of 18

Showing per page

On interval decomposition lattices

Stephan Foldes, Sándor Radeleczki (2004)

Discussiones Mathematicae - General Algebra and Applications

Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in an ordered set. They are defined abstractly as closed sets of a closure system on a set V, satisfying certain axioms. Decompositions are partitions of V whose blocks are intervals, and they form an algebraic semimodular lattice. Lattice-theoretical properties of decompositions are explored, and connections with particular types of intervals are established.

On matrix rapid filters

Winfried Just, Peter Vojtáš (1997)

Fundamenta Mathematicae

Galois-Tukey equivalence between matrix summability and absolute convergence of series is shown and an alternative characterization of rapid ultrafilters on ω is derived.

On M-operators of q-lattices

Radomír Halaš (2002)

Discussiones Mathematicae - General Algebra and Applications

It is well known that every complete lattice can be considered as a complete lattice of closed sets with respect to appropriate closure operator. The theory of q-lattices as a natural generalization of lattices gives rise to a question whether a similar statement is true in the case of q-lattices. In the paper the so-called M-operators are introduced and it is shown that complete q-lattices are q-lattices of closed sets with respect to M-operators.

Currently displaying 1 – 18 of 18

Page 1