996 research outputs found

    SCS 69: Order Generation and Distributive Laws in Complete Lattices

    Get PDF

    SCS 92: Products of Continuous Partially Ordered Sets

    Get PDF

    Prime Ideal Theorems and systems of finite character

    Get PDF
    summary:\font\jeden=rsfs7 \font\dva=rsfs10 We study several choice principles for systems of finite character and prove their equivalence to the Prime Ideal Theorem in ZF set theory without Axiom of Choice, among them the Intersection Lemma (stating that if \text{\jeden S} is a system of finite character then so is the system of all collections of finite subsets of \bigcup \text{\jeden S} meeting a common member of \text{\jeden S}), the Finite Cutset Lemma (a finitary version of the Teichm"uller-Tukey Lemma), and various compactness theorems. Several implications between these statements remain valid in ZF even if the underlying set is fixed. Some fundamental algebraic and order-theoretical facts like the Artin-Schreier Theorem on the orderability of real fields, the Erdös-De Bruijn Theorem on the colorability of infinite graphs, and Dilworth's Theorem on chain-decompositions for posets of finite width, are easy consequences of the Intersection Lemma or of the Finite Cutset Lemma

    Nuclear ranges in implicative semilattices

    Get PDF
    A nucleus on a meet-semilattice A is a closure operation that preserves binary meets. The nuclei form a semilattice N A that is isomorphic to the system NA of all nuclear ranges, ordered by dual inclusion. The nuclear ranges are those closure ranges which are total subalgebras (l-ideals). Nuclei have been studied intensively in the case of complete Heyting algebras. We extend, as far as possible, results on nuclei and their ranges to the non-complete setting of implicative semilattices (whose unary meet translations have adjoints). A central tool are so-called r-morphisms, that is, residuated semilattice homomorphisms, and their adjoints, the l-morphisms. Such morphisms transport nuclear ranges and preserve implicativity. Certain completeness properties are necessary and sufficient for the existence of a least nucleus above a prenucleus or of a greatest nucleus below a weak nucleus. As in pointfree topology, of great importance for structural investigations are three specific kinds of l-ideals, called basic open, boolean and basic closed. © 2022, The Author(s)

    SCS 96: Generators and Weights of Completely Distributive Lattices

    Get PDF

    SCS 89: Continuity Concepts for Partially Ordered Sets

    Get PDF
    • …
    corecore