502 research outputs found

    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)

    Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models

    Get PDF

    The logic of interactive Turing reduction

    Full text link
    The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept -- more precisely, the associated concept of reducibility -- is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity. See http://www.cis.upenn.edu/~giorgi/cl.html for a comprehensive online source on computability logic

    Adjoint maps between implicative semilattices and continuity of localic maps

    Get PDF
    We study residuated homomorphisms (r-morphisms) and their adjoints, the so-called localizations (or l-morphisms), between implicative semilattices, because these objects may be characterized as semilattices whose unary meet operations have adjoints. Since left resp. right adjoint maps are the residuated resp. residual maps (having the property that preimages of principal downsets resp. upsets are again such), one may not only regard the l-morphisms as abstract continuous maps in a pointfree framework (as familiar in the complete case), but also characterize them by concrete closure-theoretical continuity properties. These concepts apply to locales (frames, complete Heyting lattices) and provide generalizations of continuous and open maps between spaces to an algebraic (not necessarily complete) pointfree setting. © 2022, The Author(s)

    A formal approach to vague expressions with indexicals

    Get PDF
    In this paper, we offer a formal approach to the scantily investigated problem of vague expressions with indexicals, in particular including the spatial indexical `here' and the temporal indexical `now'. We present two versions of an adaptive fuzzy logic extended with an indexical, formally expressed by a modifier as a function that applies to predicative formulas. In the first version, such an operator is applied to non-vague predicates. The modified formulas may have a fuzzy truth value and fit into a Sorites paradox. We use adaptive fuzzy logics as a reasoning tool to address such a paradox. The modifier enables us to offer an adequate explication of the dynamic reasoning process. In the second version, a different result is obtained for an indexical applied to a formula with a possibly vague predicate, where the resulting modified formula has a crisp value and does not add up to a Sorites paradox
    corecore