Well-posed minimum problems for preorders
We show that, assuming PFA, the class of all Aronszajn lines is well-quasi-ordered by embeddability.
We introduce some particular classes of filters and order-ideals in distributive semilattices, called -filters and -order-ideals, respectively. In particular, we study -filters and -order-ideals in distributive quasicomplemented semilattices. We also characterize the filters-congruence-cokernels in distributive quasicomplemented semilattices through -order-ideals.
The concept of -ideals in posets is introduced. Several properties of -ideals in -distributive posets are studied. Characterization of prime ideals to be -ideals in -distributive posets is obtained in terms of minimality of ideals. Further, it is proved that if a prime ideal of a -distributive poset is non-dense, then is an -ideal. Moreover, it is shown that the set of all -ideals of a poset with forms a complete lattice. A result analogous to separation theorem for finite -distributive...
In this paper, we generalize the notion of supremum and infimum in a poset.
We investigate σ-entangled linear orders and narrowness of Boolean algebras. We show existence of σ-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the behavior of these notions in ultraproducts.