148 research outputs found

    Canonical formulas for k-potent commutative, integral, residuated lattices

    Full text link
    Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method originally hinged on the relational semantics of those logics, recently it has been completely recast in algebraic terms. In this new perspective canonical formulas are built from a finite subdirectly irreducible algebra by describing completely the behaviour of some operations and only partially the behaviour of some others. In this paper we export the machinery of canonical formulas to substructural logics by introducing canonical formulas for kk-potent, commutative, integral, residuated lattices (kk-CIRL\mathsf{CIRL}). We show that any subvariety of kk-CIRL\mathsf{CIRL} is axiomatised by canonical formulas. The paper ends with some applications and examples.Comment: Some typo corrected and additional comments adde

    Exploring a syntactic notion of modal many-valued logics

    Get PDF
    We propose a general semantic notion of modal many-valued logic. Then, we explore the di culties to characterize this notion in a syntactic way and analyze the existing literature with respect to this frameworkPeer Reviewe

    Poset products as relational models

    Full text link
    We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and generalizes two semantics already appearing in the literature: Aguzzoli, Bianchi, and Marra's temporal flow semantics for H\'ajek's basic logic, and Lewis-Smith, Oliva, and Robinson's semantics for intuitionistic Lukasiewicz logic. As a consequence of our general theory, we recover the soundness and completeness results of these prior studies in a uniform fashion, and extend them to infinitely-many other substructural logics

    Priestley duality for MV-algebras and beyond

    Get PDF
    We provide a new perspective on extended Priestley duality for a large class of distributive lattices equipped with binary double quasioperators. Under this approach, non-lattice binary operations are each presented as a pair of partial binary operations on dual spaces. In this enriched environment, equational conditions on the algebraic side of the duality may more often be rendered as first-order conditions on dual spaces. In particular, we specialize our general results to the variety of MV-algebras, obtaining a duality for these in which the equations axiomatizing MV-algebras are dualized as first-order conditions
    • …
    corecore