In this paper, we extend the canonicity methodology in Ghilardi & Meloni (1997) to arbitrary lattice expansions, and syntactically describe canonical inequalities for lattice expansions consisting of -meet preserving operations, -multiplicative operations, adjoint pairs, and constants. This approach gives us a uniform account of canonicity for substructural and lattice-based logics. Our method not only covers existing results, but also systematically accounts for many canonical inequalities containing nonsmooth additive and multiplicative uniform operations. Furthermore, we compare our technique with the approach in (...) Dunn et al. (2005) and Gehrke et al. (2005). (shrink)

Algebraic work [9] shows that the deep theory of possible world semantics is available in the more general setting of substructural logics, at least in an algebraic guise. The question is whether it is also available in a relational form.This article seeks to set the stage for answering this question. Guided by the algebraic theory, but purely relationally we introduce a new type of frames. These structures generalize Kripke structures but are two-sorted, containing both worlds and co-worlds. These latter points (...) may be viewed as modelling irreducible increases in information where worlds model irreducible decreases in information. Based on these structures, a purely model theoretic and uniform account of completeness for the implication-fusion fragment of various substructural logics is given. Completeness is obtained via a generalization of the standard canonical model construction in combination with correspondence results. (shrink)

This paper develops an order-theoretic generalization of Blok and Pigozziʼs notion of an algebraizable logic. Unavoidably, the ordered model class of a logic, when it exists, is not unique. For uniqueness, the definition must be relativized, either syntactically or semantically. In sentential systems, for instance, the order algebraization process may be required to respect a given but arbitrary polarity on the signature. With every deductive filter of an algebra of the pertinent type, the polarity associates a reflexive and transitive relation (...) called a Leibniz order, analogous to the Leibniz congruence of abstract algebraic logic . Some core results of AAL are extended here to sentential systems with a polarity. In particular, such a system is order algebraizable if the Leibniz order operator has the following four independent properties: it is injective, it is isotonic, it commutes with the inverse image operator of any algebraic homomorphism, and it produces anti-symmetric orders when applied to filters that define reduced matrix models. Conversely, if a sentential system is order algebraizable in some way, then the order algebraization process naturally induces a polarity for which the Leibniz order operator has properties –. (shrink)

The work is concerned with the so called display property of display logic. The motivation behind it is discussed and challenged. It is shown using one display calculus for intuitionistic logic as an example that the display property can be abandoned without losing subformula, cut elimination and completeness properties in such a way that results in additional expressive power of the system. This is done by disentangling structural connectives so that they are no longer context-sensitive. A recipe for characterizing structural (...) extensions of display calculi is provided. (shrink)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

In an article dating back in 1992, Kosta Došen initiated a project of modal translations in substructural logics, aiming at generalising the well-known Gödel–McKinsey–Tarski translation of intuitionistic logic into S4. Došen's translation worked well for (variants of) BCI and stronger systems (BCW, BCK), but not for systems below BCI. Dropping structural rules results in logic systems without distribution. In this article, we show, via translation, that every substructural (indeed, every non-distributive) logic is a fragment of a corresponding sorted, residuated (multi) (...) modal logic. At the conceptual and philosophical level, the translation provides a classical interpretation of the meaning of the logical operators of various non-distributive propositional calculi. Technically, it allows for an effortless transfer of results, such as compactness and the Löwenheim-Skolem property and it opens up new directions for deducing properties of substructural logic systems by establishing appropriate transfer theorems. (shrink)

We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.

We introduce game-theoretic semantics for systems without the conveniences of either a De Morgan negation, or of distribution of conjunction over disjunction and conversely. Much of game playing rests on challenges issued by one player to the other to satisfy, or refute, a sentence, while forcing him/her to move to some other place in the game’s chessboard-like configuration. Correctness of the game-theoretic semantics is proven for both a training game, corresponding to Positive Lattice Logic and for more advanced games for (...) the logics of lattices with weak negation and modal operators. (shrink)

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used to construct canonical extensions of lattice-based algebras. We study classes of structures that are closed under ultraproducts and whose (...) stable set lattices have additional operators that are first-order definable in the underlying structure. We show that such classes generate varieties of algebras that are closed under canonical extensions. The proof makes use of a relationship between canonical extensions and MacNeille completions. (shrink)

Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary protoalgebraic deductive systems. As an application, we obtain a Sahlqvist theorem for the fragments of the intuitionistic propositional calculus that include the implication connective and for the extensions of the intuitionistic linear logic.

This work is part of a wider investigation into lattice-structured algebras and associated dual representations obtained via the methodology of canonical extensions. To this end, here we study lattices, not necessarily distributive, with negation operations. We consider equational classes of lattices equipped with a negation operation ¬ which is dually self-adjoint (the pair (¬,¬) is a Galois connection) and other axioms are added so as to give classes of lattices in which the negation is De Morgan, orthonegation, antilogism, pseudocomplementation or (...) weak pseudocomplementation. These classes are shown to be canonical and dual relational structures are given in a generalized Kripke-style. The fact that the negation is dually self-adjoint plays an important role here, as it implies that it sends arbitrary joins to meets and that will allow us to define the dual structures in a uniform way. (shrink)

Constructive dualities have recently been proposed for some lattice-based algebras and a related project has been outlined by Holliday and Bezhanishvili, aiming at obtaining “choice-free spatial dualities for other classes of algebras [ $$\ldots $$ ], giving rise to choice-free completeness proofs for non-classical logics”. We present in this article a way to complete the Holliday–Bezhanishvili project (uniformly, for any normal lattice expansion). This is done by recasting in a choice-free manner recent relational representation and duality results by the author. (...) These results addressed the general representation and duality problem for lattices with quasi-operators, extending the Jónsson–Tarski approach for BAOs, and Dunn’s follow-up approach for distributive generalized Galois logics, to contexts where distributivity may not be assumed. To illustrate, we apply the framework to lattices (and their logics) with some form or other of a (quasi)complementation operator, obtaining correspondence results and canonical extensions in relational frames and choice-free dualities for lattices with a minimal, or a Galois quasi-complement, or involutive lattices, including De Morgan algebras, as well as Ortholattices and Boolean algebras, as special cases. (shrink)

This paper is a study of duality in the absence of canonicity. Specifically it concerns double quasioperator algebras, a class of distributive lattice expansions in which, coordinatewise, each operation either preserves both join and meet or reverses them. A variety of DQAs need not be canonical, but as has been shown in a companion paper, it is canonical in a generalized sense and an algebraic correspondence theorem is available. For very many varieties, canonicity (as traditionally defined) and correspondence lead on (...) to topological dualities in which the topological and correspondence components are quite separate. It is shown that, for DQAs, generalized canonicity is sufficient to yield, in a uniform way, topological dualities in the same style as those for canonical varieties. However topology and correspondence are no longer separable in the same way. (shrink)

We introduce a new and general notion of canonical extension for algebras in the algebraic counterpart of any finitary and congruential logic . This definition is logic-based rather than purely order-theoretic and is in general different from the definition of canonical extensions for monotone poset expansions, but the two definitions agree whenever the algebras in are based on lattices. As a case study on logics purely based on implication, we prove that the varieties of Hilbert and Tarski algebras are canonical (...) in this new sense. (shrink)

Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalisation of the theory of canonical extension to the setting of first order logic. We define a notion of canonical extension for coherent categories. These are the categorical analogues of distributive lattices and they provide categorical semantics for coherent logic, the fragment of first order logic in the connectives ∧, ∨, 0, 1 and ∃. We describe a universal property (...) of our construction and show that it generalises the existing notion of canonical extension for distributive lattices. Our new construction for coherent categories has led us to an alternative description of the topos of types, introduced by Makkai in [22]. This allows us to give new and transparent proofs of some properties of the action of the topos of types construction on morphisms. Furthermore, we prove a new result relating, for a coherent category C, its topos of types to its category of models. (shrink)