Generalized Dedekind completion of a lattice ordered group

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dedekind-MacNeille Completion of n -ordered Sets

A completion of an n-ordered set P = 〈P, 1, . . . , n〉 is defined, by analogy with the case of posets (2-ordered sets), as a pair 〈e,Q〉, where Q is a complete n-lattice and e : P → Q is an n-order embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary nordered set. The completion reduces to the Dedekind–MacNeille completion in the dyadic...

متن کامل

Lattice of compactifications of a topological group

We show that the lattice of compactifications of a topological group $G$ is a complete lattice which is isomorphic to the lattice of all closed normal subgroups of the Bohr compactification $bG$ of $G$. The correspondence defines a contravariant functor from the category of topological groups to the category of complete lattices. Some properties of the compactification lattice of a topological ...

متن کامل

On the Congruence Lattice of an Abelian Lattice Ordered Group

In the present note we characterize finite lattices which are isomorphic to the congruence lattice of an abelian lattice ordered group.

متن کامل

Dedekind-MacNeille Completion of n-Lattices

A completion of an n-lattice L = 〈L,.1, . . . , .n〉 is defined, by analogy with lattices, as a pair 〈e,C〉, where C is a complete n-lattice and e : L → C is an n-lattice embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary n-lattice. The completion reduces to the Dedekind-MacNeille completion in the dyadic case, which was first formulat...

متن کامل

Stepwise Construction of the Dedekind-MacNeille Completion

form a complete lattice, the D e d e k i n d M a c N e i l l e c o m p l e t i o n (or short comp l e t i o n ) of (P, <). It is the smallest complete lattice containing a subset orderisomorphic with (P, <). The size of the completion may be exponential in [PI. The completion can be computed in steps: first complete a small part of (P, <), then add another element, complete again, et cetera. Ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1978

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1978.101532