Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity

Authors Didier Galmiche, Marta Gawek, Daniel Méry



PDF
Thumbnail PDF

File

LIPIcs.FSCD.2021.13.pdf
  • Filesize: 0.78 MB
  • 21 pages

Document Identifiers

Author Details

Didier Galmiche
  • Université de Lorraine, CNRS, LORIA, Nancy, France
Marta Gawek
  • Université de Lorraine, CNRS, LORIA, Nancy, France
Daniel Méry
  • Université de Lorraine, CNRS, LORIA, Nancy, France

Cite AsGet BibTex

Didier Galmiche, Marta Gawek, and Daniel Méry. Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity. In 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 195, pp. 13:1-13:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.FSCD.2021.13

Abstract

In this paper we consider the intuitionistic sentential calculus with Suszko’s identity (ISCI). After recalling the basic concepts of the logic and its associated Hilbert proof system, we introduce a new sound and complete class of models for ISCI which can be viewed as algebraic counterparts (and extensions) of sheaf-theoretic topological models of intuitionistic logic. We use this new class of models, called Beth semantics for ISCI, to derive a first labelled sequent calculus and show its adequacy w.r.t. the standard Hilbert axiomatization of ISCI. This labelled proof system, like all other current proof systems for ISCI that we know of, does not enjoy the subformula property, which is problematic for achieving termination. We therefore introduce a second labelled sequent calculus in which the standard rules for identity are replaced with new special rules and show that this second calculus admits cut-elimination. Finally, using a key regularity property of the forcing relation in Beth models, we show that the eigenvariable condition can be dropped, thus leading to the termination and decidability results.

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • Algebraic Semantics
  • Beth Models
  • Labelled Deduction
  • Intuitionistic Logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. S.L. Bloom and R. Suszko. Investigations into the Sentential Calculus with Identity. Notre Dame Journal of Formal Logic, 13(3):289-308, 1972. Google Scholar
  2. S. Chlebowski. Sequent Calculi for SCI. Studia Logica, 106(3):541-563, 2018. Google Scholar
  3. S. Chlebowski and D. Leszcyńska-Jasion. An Investigation into Intuitionistic Logic with Identity. Bulletin of the Section of Logic, 48(4):259-283, 2019. Google Scholar
  4. D. Galmiche, D. Méry, and D. Pym. The semantics of BI and Resource Tableaux. Mathematical Structures in Computer Science, 15(6):1033-1088, 2005. Google Scholar
  5. D. Galmiche and D. Méry. A Connection-based Characterization of Bi-intuitionistic Validity. Journal of Automated Reasoning, 51(1):3-26, 2013. URL: https://doi.org/10.1007/s10817-013-9279-4.
  6. J. Golińska-Pilarek. Rasiowa–Sikorski proof system for the non-Fregean sentential logic. Journal of Applied Non-Classical Logics, 17(4):511–519, 2007. Google Scholar
  7. J. Golińska-Pilarek and T. Huuskonen. Non-Fregean Propositional Logic with Quantifiers. Notre Dame Journal of Formal Logic, 57(2):249-279, 2016. URL: https://doi.org/10.1215/00294527-3470547.
  8. Z. Hou, R. Goré, and A. Tiu. A labelled sequent calculus for BBI: Proof theory and proof search. Journal of Logic and Computation, 28(4):809-872, 2018. URL: https://doi.org/10.1007/978-3-642-40537-2_16.
  9. P. Lukowski. Intuitionistic sentential calculus with identity. Bulletin of the Section of Logic, 19(3):92-99, 1990. Google Scholar
  10. S. Negri and J. von Plato. Cut elimination in the presence of axioms. Bulletin of Symbolic Logic, 4(4):418–435, 1998. Google Scholar
  11. S. Negri and J. von Plato. Proof Analysis - A Contribution to Hilbert’s Last Problem. Cambridge University Press, 2014. URL: http://www.cambridge.org/de/academic/subjects/philosophy/logic/proof-analysis-contribution-hilberts-last-problem?format=PB.
  12. R. Suszko. Abolition of the Fregean axiom. In Logic Colloquium, pages 169-239, 1975. Springer. Google Scholar
  13. A. Wasilewska. DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations. Studia Logica, 43(4):395–404, 1984. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail