On a class of universal ordered sets

نویسندگان

چکیده

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

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

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

منابع مشابه

On a universal best choice algorithm for partially ordered sets

For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lower bound of its chance of success from the hitherto known constant 1/8 to 1/4. We also show that this result is the best possible for this algorithm, i.e., the 1/4 bound cannot be further improved.

متن کامل

Fuzzy universal algebras on $L$-sets

This paper attempts to generalize universal algebras on classical sets to $L$-sets when $L$ is a GL-quantale. Some basic notions of fuzzy universal algebra on an $L$-set are introduced, such as subalgebra, quotient algebra, homomorphism, congruence, and direct product etc. The properties of them are studied. $L$-valued power algebra is also introduced and it is shown there is an onto homomorphi...

متن کامل

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

Completions of Partially Ordered Sets and Universal Algebra

The results' in this paper were motivated by a search for the answers to the following questions : When can a given partially ordered algebra be embedded in a complete partially ordered algebra in such a fashion that the original algebra is dense and that the operations acquire or maintain continuity properties? What type of identities are preserved under such embeddings? Properties of extensio...

متن کامل

A Problem on Ordered Sets

1. Let S be an ordered set, of power 1 SI and order type 8 = 4, We denote by #* the converse of 4, i.e. the order type obtained from + by replacing every order relation x < y by the corresponding relation y < x, and by wrc the least ordinal number of power N,. It is easy to see that, if ISl=tQ, then S contains a subset S’ such that either s’ = w,, or 8’ = w**. For cardinals N, > w’. the corresp...

متن کامل

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


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

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1958

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1958-0096592-0