Unified correspondence as a proof-theoretic tool

DOI10.1093/LOGCOM/EXW022zbMATH Open1444.03055arXiv1603.08204OpenAlexW2963466275MaRDI QIDQ4612445FDOQ4612445

Authors: Giuseppe Greco, Minghui Ma, Alessandra Palmigiano, Apostolos Tzimoulis, Zhiguang Zhao 

Publication date: 31 January 2019

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Abstract: The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and exploited by Marcus Kracht, in the context of his characterization of the modal axioms (which he calls primitive formulas) which can be effectively transformed into `analytic' structural rules of display calculi. In this context, a rule is `analytic' if adding it to a display calculus preserves Belnap's cut-elimination theorem. In recent years, the state-of-the-art in correspondence theory has been uniformly extended from classical modal logic to diverse families of nonclassical logics, ranging from (bi-)intuitionistic (modal) logics, linear, relevant and other substructural logics, to hybrid logics and mu-calculi. This generalization has given rise to a theory called unified correspondence, the most important technical tools of which are the algorithm ALBA, and the syntactic characterization of Sahlqvist-type classes of formulas and inequalities which is uniform in the setting of normal DLE-logics (logics the algebraic semantics of which is based on bounded distributive lattices). We apply unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics. The results of the present paper characterize the space of properly displayable DLE-logics.

Full work available at URL: https://arxiv.org/abs/1603.08204

Recommendations

• Unified correspondence
• Unified correspondence and proof theory for strict implication
• Algorithmic correspondence and canonicity for non-distributive logics
• Algebraic modal correspondence: Sahlqvist and beyond
• Sequent Calculi for Normal Modal Propositional Logics

zbMATH Keywords

display calculidistributive lattice expansionsunified correspondenceproperly displayable logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05)

Cited In (21)

• Intermediate logics admitting a structural hypersequent calculus
• Title not available (Why is that?)
• Non-normal modal logics and conditional logics: semantic analysis and proof theory
• Labelled calculi for lattice-based modal logics
• Proof spaces for unbounded parallelism
• Title not available (Why is that?)
• Syntactic Completeness of Proper Display Calculi
• Subordination algebras as semantic environment of input/output logic
• Semi De Morgan logic properly displayed
• Bilattice logic properly displayed
• Proper multi-type display calculi for rough algebras
• Lambek-Grishin calculus: focusing, display and full polarization
• Correspondences between classical, intuitionistic and uniform provability
• Sequent systems for negative modalities
• Abstractions of uniform proofs
• Linear Logic Properly Displayed
• Algebraic proof theory for LE-logics
• Modal reduction principles: a parametric shift to graphs
• Non-distributive description logic
• Algorithmic correspondence and canonicity for non-distributive logics
• Disentangling structural connectives or life without display property

This page was built for publication: Unified correspondence as a proof-theoretic tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612445)