Skip to main content

Advertisement

SpringerLink
  1. Home
  2. Studia Logica
  3. Article
Semantical Analysis of the Logic of Bunched Implications
Download PDF
Your article has downloaded

Similar articles being viewed by others

Slider with three articles shown per slide. Use the Previous and Next buttons to navigate the slides or the slide controller buttons at the end to navigate through each slide.

A Proof Theory for Model Checking

18 June 2018

Quentin Heath & Dale Miller

Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter

17 July 2018

Mikhail Rybakov & Dmitry Shkatov

On the Metainferential Solution to the Semantic Paradoxes

22 October 2022

Rea Golan

Disjunction and Existence Properties in Inquisitive First-Order Logic

24 October 2018

Gianluca Grilletti

Satisfiability is False Intuitionistically: A Question from Dana Scott

14 October 2019

Charles McCarty

Proof Theory for Positive Logic with Weak Negation

24 July 2019

Marta Bílková & Almudena Colacito

Strong Extension-Free Proof Systems

22 February 2019

Marijn J. H. Heule, Benjamin Kiesl & Armin Biere

The original sin of proof-theoretic semantics

14 December 2018

Bogdan Dicher & Francesco Paoli

An ecumenical notion of entailment

03 May 2019

Elaine Pimentel, Luiz Carlos Pereira & Valeria de Paiva

Download PDF
  • Open Access
  • Published: 31 January 2023

Semantical Analysis of the Logic of Bunched Implications

  • Alexander V. Gheorghiu  ORCID: orcid.org/0000-0002-7144-69101 &
  • David J. Pym1,2,3 

Studia Logica (2023)Cite this article

  • 41 Accesses

  • Metrics details

Abstract

We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason with eigenworlds (i.e., generic representatives of worlds) in an arbitrary model. This reasoning is captured by a sequent calculus for a meta-logic (in this case, first-order classical logic) expressive enough to capture the semantics of the object-logic. Essentially, one has a calculus of validity for the object-logic. The method proceeds through the perspective of reductive logic (as opposed to the more traditional paradigm of deductive logic), using the space of reductions as a medium for showing the behavioural equivalence of reduction in the sequent calculus for the object-logic and in the validity calculus. Rather than study the technique in general, we illustrate it for the logic of Bunched Implications (BI), thus IPL and MILL (without negation) are also treated. Intuitively, BI is the free combination of intuitionistic propositional logic and multiplicative intuitionistic linear logic, which renders its meta-theory is quite complex. The literature on BI contains many similar, but ultimately different, algebraic structures and satisfaction relations that either capture only fragments of the logic (albeit large ones) or have complex clauses for certain connectives (e.g., Beth’s clause for disjunction instead of Kripke’s). It is this complexity that motivates us to use BI as a case-study for this approach to semantics.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

Data Availability

There is no data associated with this manuscript.

References

  1. Beth, W.E., Semantic Constructions of Intuitionistic Logic, Mededelingen Der Koninklijke Nederlandse Akademie Vanwetenschappen, Afd. Letterkunde 19(11):357–388, 1956.

  2. Brotherston, J., Bunched Logics Displayed, Studia Logica 100(6):1223–1254, 2012.

  3. Bundy, A., The Computer Modelling of Mathematical Reasoning, Academic Press Professional Inc., 1985.

  4. Cao, Q., S. Cuellar, and A. W. Appel, Bringing Order to the Separation Logic Jungle, in Bor-Yuh Evan Chang, (ed.), Asian Symposium on Programming Languages and Systems – APLAS 15, vol. 10695 of Lecture Notes in Computer Science, Springer, 2017, pp. 190–211.

  5. Docherty, S., Bunched Logics: A Uniform Approach, Ph.D. thesis, University College London, 2019.

  6. Docherty, S., and D. Pym, Intuitionistic Layered Graph Logic, in N. Olivetti, and A. Tiwari, (eds.), International Joint Conference on Automated Reasoning – IJCAR 16, Springer, 2016, pp. 469–486.

  7. Docherty, S., and D. Pym, Modular Tableaux Calculi for Separation Theories, in Ch. Baier, and U. Dal Lago, (eds.), Foundations of Software Science and Computation Structures – FOSSACS 21, Springer International Publishing, 2018, pp. 441–458.

  8. Docherty, S., and D. J. Pym, A Stone-type Duality Theorem for Separation Logic via its Underlying Bunched Logics, Electronic Notes in Theoretical Computer Science 336:101–118, 2018.

  9. Docherty, S., and D. J. Pym, Intuitionistic Layered Graph Logic: Semantics and Proof Theory, Logical Methods in Computer Science 14:1–36, 2018.

  10. Docherty, S., and D. J. Pym, Stone-Type Dualities for Separation Logics, Logical Methods in Computer Science 15:1–40, 2019.

  11. Dummett, M. A. E., Elements of Intuitionism, vol. 39 of Oxford Logic Guides, Clarendon Press, 2000.

  12. Gabbay, D.M., Fibring Logics, vol. 38 of Oxford Logic Guides, Clarendon Press, 1998.

  13. Galmiche, D., M. Marti, and D. Mery, Relating Labelled and Label-Free Bunched Calculi in BI Logic, in S. Cerrito, and A. Popescu, (eds.), Automated Reasoning with Analytic Tableaux and Related Methods – Tableaux 28, Springer International Publishing, 2019, pp. 130–146

  14. Galmiche, D., D. Mery, and D. Pym, The Semantics of BI and Resource Tableaux, Mathematical Structures in Computer Science 15(6):1033–1088, 2005.

  15. Gheorghiu, A.V., S. Docherty, and D.J. Pym, Reductive Logic, Coalgebra, and Proof-search: A Perspective from Resource Semantics, in A. Palmigiano, and M. Sadrzadeh, (eds.), Samson Abramsky on Logic and Structure in Computer Science and Beyond, vol. 25 of Outstanding Contributions to Logic, Springer, 2023, to appear.

  16. Gheorghiu, A.V., and S. Marin, Focused Proof-search in the Logic of Bunched Implications, in S. Kiefer, and Ch. Tasson, (eds.), Foundations of Software Science and Computation Structures – FOSSACS 24, vol. 12650 of Lecture Notes in Computer Science, Springer, 2021, pp. 247–267.

  17. Komendantskaya, E., G. McCusker, and J. Power, Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming, in M. Johnson, and D. Pavlovic, (eds.), International Conference on Algebraic Methodology and Software Technology – AMAST 13, vol. 6486 of Lecture Notes in Computer Science, Springer, 2011, pp. 111–127.

  18. Kowalski, R., Logic for Problem Solving, vol. 7 of Artificial Intelligence Series, Elsevier North Holland, 1979.

  19. Kowalski, R., and D. Kuehner, Linear Resolution with Selection Function, Artificial Intelligence 2(3):227–260, 1971.

  20. Kreisel, G., Elementary Completeness Properties of Intuitionistic Logic with a Note on Negations of Prenex Formulae, The Journal of Symbolic Logic 23(3):317–330, 1958.

    Article  Google Scholar 

  21. Kripke, S. A., Semantical Analysis of Intuitionistic Logic I, in J. N. Crossley, and M. A. E. Dummett, (eds.), Formal Systems and Recursive Functions, vol. 40 of Studies in Logic and the Foundations of Mathematics, Elsevier, 1965, pp. 92–130.

  22. Milner, R., The Use of Machines to Assist in Rigorous Proof, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences 312(1522):411–422, 1984.

  23. Negri, S., Proof Analysis in Modal Logic, Journal of Philosophical Logic 34(5):507–544, 2005.

  24. O’Hearn, P. W., and D. J. Pym, The Logic of Bunched Implications, The Bulletin of Symbolic Logic 5(2):215–244, 1999.

  25. Pym, D. J., The Semantics and Proof Theory of the Logic of Bunched Implications, vol. 26 of Applied Logic Series, Springer, 2002.

  26. Pym, D. J., P. W. O’Hearn, and H. Yang, Possible Worlds and Resources: The Semantics of BI, Theoretical Computer Science 315(1):257–305, 2004.

  27. Pym, D. J., and E. Ritter, Reductive Logic and Proof-search: Proof theory, Semantics, and Control, vol. 45 of Oxford Logic Guides, Clarendon Press, 2004.

  28. Read, S., Relevant Logic, Basil Blackwell, 1988.

  29. Routley, R., and R. Meyer, The Semantics of Entailment, in H. Leblanc, (ed.), Truth, Syntax, and Modality, vol. 68 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1973, pp. 199–243.

  30. Schroeder-Heister, P., Proof-Theoretic Semantics, in E. N. Zalta, (ed.), The Stanford Encyclopedia of Philosophy, Metaphysics Research Lab, Stanford University, Spring 2018.

  31. Szabo, M. E., (ed.), The Collected Papers of Gerhard Gentzen, North-Holland Publishing Company, 1969.

  32. Troelstra, A. S., and H. Schwichtenberg, Basic Proof Theory, vol. 43 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2000.

  33. Urquhart, A., Semantics for Relevant Logics, The Journal of Symbolic Logic 37(1):159–169, 1972.

Download references

Acknowledgements

We are grateful to Timo Lang, Simon Docherty, and the referees for their thorough and thoughtful comments on this work.

Author information

Authors and Affiliations

  1. Department of Computer Science, University College London, London, WC1E 6BT, UK

    Alexander V. Gheorghiu & David J. Pym

  2. Department of Philosophy, University College London, London, WC1E 6BT, UK

    David J. Pym

  3. Institute of Philosophy, University of London, London, WC1E 7HU, UK

    David J. Pym

Authors
  1. Alexander V. Gheorghiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David J. Pym
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander V. Gheorghiu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Presented by Francesco Paoli

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Gheorghiu, A.V., Pym, D.J. Semantical Analysis of the Logic of Bunched Implications. Stud Logica (2023). https://doi.org/10.1007/s11225-022-10028-z

Download citation

  • Received: 28 March 2022

  • Accepted: 17 November 2022

  • Published: 31 January 2023

  • DOI: https://doi.org/10.1007/s11225-022-10028-z

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Logic
  • Proof theory
  • Model theory
  • Semantics
  • Bunched logic
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Over 10 million scientific documents at your fingertips

Switch Edition
  • Academic Edition
  • Corporate Edition
  • Home
  • Impressum
  • Legal information
  • Privacy statement
  • California Privacy Statement
  • How we use cookies
  • Manage cookies/Do not sell my data
  • Accessibility
  • FAQ
  • Contact us
  • Affiliate program

Not affiliated

Springer Nature

© 2023 Springer Nature Switzerland AG. Part of Springer Nature.