EuDML | Browse

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

Items

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

Displaying 21 – 40 of 186

Bourbaki's Fixpoint Lemma reconsidered

Bernhard Banaschewski (1992)

Commentationes Mathematicae Universitatis Carolinae

A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chain-complete partially ordered sets is presented to obtain a condition for one closure system in a complete lattice $L$ to be stable under another closure operator of $L$ . This is then used to deal with coproducts and other aspects of frames.

Calcul des relations inverses

René Guitart (1977)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

Canonical extensions of Stone and double Stone algebras: the natural way

Miroslav Haviar, Hilary A. Priestley (2006)

Mathematica Slovaca

Categories of closure spaces and corresponding lattices

Claude-Alain Faure (1994)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

CCD lattices in presheaf categories.

Cruttwell, G.S.H., Marmolejo, F., Wood, R.J. (2007)

Theory and Applications of Categories [electronic only]

Center of a bounded lattice

Ján Jakubík (1975)

Matematický časopis

Center of a complete lattice

Ján Jakubík (1973)

Czechoslovak Mathematical Journal

Characterization of lattices of convex subsets of posets

Judita Lihová (2000)

Czechoslovak Mathematical Journal

Characterizations of certain classes of posets having Gs-lattices of a relatively small size

Josef Dalík (1981)

Czechoslovak Mathematical Journal

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

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