Algorithmic correspondence and canonicity for non-distributive logics (original) (raw)

Algebraic proof theory for LE-logics

arXiv: Logic, 2018

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics). Specifically, we generalise the residuated frames in [16] to arbitrary signatures of normal lattice expansions (LE). Such a generalization provides a valuable tool for proving important properties of LE-logics in full uniformity. We prove semantic cut elimination for the display calculi D.LE associated with the basic normal LE-logics and their axiomatic extensions with analytic inductive axioms. We also prove the finite model property (FMP) for each such calculus D.LE, as well as for its extensions with analytic structural rules satisfying certain additional properties.

Constructive Canonicity of Inductive Inequalities

Log. Methods Comput. Sci., 2020

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions. This result encompasses Ghilardi-Meloni's and Suzuki's constructive canonicity results for Sahlqvist formulas and inequalities, and is based on an application of the tools of unified correspondence theory. Specifically, we provide an alternative interpretation of the language of the algorithm ALBA for lattice expansions: nominal and conominal variables are respectively interpreted as closed and open elements of canonical extensions of normal/regular lattice expansions, rather than as completely join-irreducible and meet-irreducible elements of perfect normal/regular lattice expansions. We show the correctness of ALBA with respect to this interpretation. From this fact, the constructive canonicity of the inequalities on which ALBA succeeds follows by an adaptation of the standard argument. The clai...

Dual characterizations for finite lattices via correspondence theory for monotone modal logic

Journal of Logic and Computation, 2016

We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation's characterization of a hierarchy of pseudovarieties of finite lattices, progressively generalizing finite distributive lattices. This formal connection is mediated through monotone modal logic. Indeed, we adapt the correspondence algorithm ALBA to the setting of monotone modal logic, and we use a certain duality-induced encoding of finite lattices as monotone neighbourhood frames to translate lattice terms into formulas in monotone modal logic.

Algorithmic correspondence and canonicity for distributive modal logic

Annals of Pure and Applied Logic, 2012

We define the algorithm ALBA for the language of the same distributive modal logic (DML) for which a Sahlqvist theorem was proved by Gehrke, Nagahashi, and Venema. Successful executions of ALBA compute the local first-order correspondents of input DML inequalities, and also guarantee their canonicity. The class of inequalities on which ALBA is successful is strictly larger than the newly introduced class of inductive inequalities, which in its turn properly extends the Sahlqvist inequalities of Gehrke et al. Evidence is given to the effect that, as their name suggests, inductive inequalities are the distributive counterparts of the inductive formulas of Goranko and Vakarelov in the classical setting.

Unified inverse correspondence for DLE-Logics

arXiv (Cornell University), 2022

By exploiting the algebraic and order theoretic mechanisms behind Sahlqvist correspondence, the theory of unified correspondence provides powerful tools for correspondence and canonicity across different semantics and signatures, covering all the logics whose algebraic semantics are given by normal (distributive) lattice expansions (referred to as (D)LEs). In particular, the algorithm ALBA, parametric in each (D)LE, effectively computes the first order correspondents of (D)LE-inductive formulas. We present an algorithm that makes use of ALBA's rules and algebraic language to invert its steps in the DLE setting; therefore effectively computing an inductive formula starting from its first order correspondent.

An algebraic analysis of implication in non-distributive logics

2021

In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g. (generalized) orthomodular lattices, and MV-algebras, which admit a natural notion of implication. In fact, it turns out that skew Hilbert algebras play a similar role for (strongly) sectionally pseudocomplemented posets as Hilbert algebras do for relatively pseudocomplemented ones. We will discuss basic properties of closed, dense, and weakly dense elements of skew Hilbert algebras, their applications, and we will provide some basic results on their structure theory. AMS Subject Classification: 06D15, 03G12, 03G10.

On the content of lattices of logics. Part I

For every consequence (or closure) operator Cn on a set S, the family C of all Cn-closed sets, partially ordered by set inclusion, forms a complete lattice, called the lattice of logics. If the lattice C is distributive, then, it forms a Heyting algebra, since it has the zero element Cn(0) and is complete. Logics determined by this Heyting algebra is studied in the second part. In Part I it is shown (for Cn finitary or compact) that the lattice C is distributive iff its dual space is topological. Moreover a representation theorem for lattices of logics is given.

Logics preserving degrees of truth from varieties of residuated lattices

Journal of Logic and Computation, 2012

Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is the only truth value preserved by the inferences of the logic. In this paper we introduce another logic associated with K, namely the logic that preserves degrees of truth, in the sense that it preserves lower bounds of truth values in inferences. We study this second logic mainly from the point of view of abstract algebraic logic. We determine its algebraic models and we classify it in the Leibniz and the Frege hierarchies: we show that it is always fully selfextensional, that for most varieties K it is non-protoalgebraic, and that it is algebraizable if and only K is a variety of generalized Heyting algebras, in which case it coincides with the logic that preserves truth. We also characterize the new logic in three ways: by a Hilbert style axiomatic system, by a Gentzen style sequent calculus, and by a set of conditions on its closure operator. Concerning the relation between the two logics, we prove that the truth preserving logic is the extension of the one that preserves degrees of truth with either the rule of Modus Ponens or the rule of Adjunction for the fusion connective.

Lattice-theoretic properties of algebras of logic

Journal of Pure and Applied Algebra, 2014

In the theory of lattice-ordered groups, there are interesting examples of properties-such as projectability-that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic. For a class of integral residuated lattices that includes Heyting algebras and semilinear residuated lattices, we prove that a member of such is projectable iff the order dual of each subinterval [a, 1] is a Stone lattice. We also show that an integral GMV algebra is projectable iff it can be endowed with a positive Gödel implication. In particular, a ΨMV or an MV algebra is projectable iff it can be endowed with a Gödel implication. Moreover, those projectable involutive residuated lattices that admit a Gödel implication are investigated as a variety in the expanded signature. We establish that this variety is generated by its totally ordered members and is a discriminator variety.