Well Quasi-Ordered Sets

نویسندگان
چکیده

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

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

منابع مشابه

From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets

We consider conditions which force a well-quasi-ordered poset (wqo) to be betterquasi-ordered (bqo). In particular we obtain that if a poset P is wqo and the set Sω(P ) of strictly increasing sequences of elements of P is bqo under domination, then P is bqo. As a consequence, we get the same conclusion if Sω(P ) is replaced by J (P ), the collection of non-principal ideals of P , or by AM(P ), ...

متن کامل

Poset algebras over well quasi-ordered posets

A new class of partial order-types, class G bqo is defined and investigated here. A poset P is in the class G bqo iff the poset algebra F (P ) is generated by a better quasi-order G that is included in L(P ). The free Boolean algebra F (P ) and its free distrivutive lattice L(P ) were defined in [ABKR]. The free Boolean algebra F (P ) contains the partial order P and is generated by it: F (P ) ...

متن کامل

Well (and better) quasi-ordered transition systems

In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering; and (ii) a scheme for symbolic backward reachability analysis. We describe several models with infinitestate spaces, which can be analyzed within the framework, e.g., Petri ne...

متن کامل

Quasi-preference: Choice on Partially Ordered Sets

A preference relation is a total order on a finite set and a quasipreference relation is a partial order. This paper first introduces the classic axiomatic property of preference relation, and develops a similar axiom for the quasi-preference relation.

متن کامل

Partially Well-Ordered Closed Sets of Permutations

It is known that the \pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally de ned subsets of permutations are partially well-ordered, in which case they have a strong nite basis property. Several classes are proved to be partially well-ordered under pattern containment. Conversely, a number of new antichains are exhibited that give some insight as...

متن کامل

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


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

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 1993

ISSN: 0001-8708

DOI: 10.1006/aima.1993.1004