Skip to main content
Log in

Proof Theory of Paraconsistent Quantum Logic

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

Paraconsistent quantum logic, a hybrid of minimal quantum logic and paraconsistent four-valued logic, is introduced as Gentzen-type sequent calculi, and the cut-elimination theorems for these calculi are proved. This logic is shown to be decidable through the use of these calculi. A first-order extension of this logic is also shown to be decidable. The relationship between minimal quantum logic and paraconsistent four-valued logic is clarified, and a survey of existing Gentzen-type sequent calculi for these logics and their close relatives is addressed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. The denomination “orthologic” is now much more widespread.

  2. The information on the paper [17] was given by an anonymous referee

  3. The information on the paper [23] was given by an anonymous referee

References

  1. Almukdad, A., & Nelson, D. (1984). Constructible falsity and inexact predicates. Journal of Symbolic Logic, 49(1), 231–233.

  2. Anderson, A.R., Belnap, N.D., & et al. (1975). Entailment: the logic of relevance and necessity, Vol. 1, Princeton University Press.

  3. Aoyama, H. (2003). On a weak system of sequent calculus. Journal of Logical Philosophy, 3, 29–37.

    Google Scholar 

  4. Aoyama, H. (2004). LK, LJ, dual intuitionistic logic, and quantum logic. Notre Dame Journal of Formal Logic, 45(4), 193–213.

    Article  Google Scholar 

  5. Belnap, N.D. (1977). Modern uses of multiple-valued logic. In Epstein, G., & Dunn, J.M. (Eds.), Useful four-valued logic, A (pp. 7–37). Dordrecht: Reidel.

    Google Scholar 

  6. Birkhoff, G., & von Neumann, J. (1936). The logic of quantum mechanics. Annals of Mathematics, 37, 823–843.

    Article  Google Scholar 

  7. Cockett, J.R., & Seely, R.A.G. (2001). Finite sum-product logic. Theory and Applications of Categories, 8(5), 63–99.

    Google Scholar 

  8. Cutland, N.J., & Gibbins, P.F. (1982). A regular sequent calculus for quantum logic in which ∧ and ∨ are dual. Logique et Analyse, 99, 221–248.

    Google Scholar 

  9. Dalla Chiara, M.L., & Giuntini, R. (1989). Paraconsistent quantum logics. Foundations of Physics, 19(7), 891–904.

    Article  Google Scholar 

  10. Dunn, J.M. (1976). Intuitive semantics for first-degree entailment and ‘coupled trees’. Philosophical Studies, 29(3), 149–168.

    Article  Google Scholar 

  11. Dunn, J.M. (2000). Partiality and its dual. Studia Logica, 65, 5–40.

    Article  Google Scholar 

  12. Faggian, C., & Sambin, G. (1998). From basic logic to quantum logics with cut-elimination. International Journal of Theoretical Physics, 37(1), 31–37.

    Article  Google Scholar 

  13. Font, J.N. (1997). Belnap’s four-valued logic and de Morgan lattices. Logic Journal of the IGPL, 5(3), 413–440.

    Article  Google Scholar 

  14. Goldblatt, R. (1974). Semantic analysis of orthologic. Journal of Philosophical Logic, 3(1-2), 19–35.

    Article  Google Scholar 

  15. Kamide, N., & Wansing, H. (2015). Proof theory of N4-related paraconsistent logics, Studies in Logic 54. College Publications.

  16. Mey, D. (1989). A predicate calculus with control of derivations, Proceedings of the 3rd Workshop on Computer Science Logic, Lecture Notes in Computer Science, 440, 254–266.

    Article  Google Scholar 

  17. Mönting, J.S. (1981). Cut elimination and word problems for varieties of lattices. Algebra Universalis, 12, 290–321.

    Article  Google Scholar 

  18. Nelson, D. (1949). Constructible falsity. Journal of Symbolic Logic, 14, 16–26.

    Article  Google Scholar 

  19. Nishimura, H. (1980). Sequential method in quantum logic. Journal of Symbolic Logic, 45, 339–352.

    Article  Google Scholar 

  20. Nishimura, H. (1994). Proof theory for minimal quantum logic I. International Journal of Theoretical Physics, 33(1), 103–113.

    Article  Google Scholar 

  21. Nishimura, H. (1994). Proof theory for minimal quantum logic II. International Journal of Theoretical Physics, 33(7), 1427–1443.

    Article  Google Scholar 

  22. Pynko, A.P. (1995). Characterizing Belnap’s logic via de Morgan’s laws. Mathematical Logic Quarterly, 41, 442–454.

    Article  Google Scholar 

  23. Restall, G., & Paoli, F. (2005). The geometry of nondistributive logics. Journal of Symbolic Logic, 70(4), 1108–1126.

    Article  Google Scholar 

  24. Sambin, G., Battilotti, C., & Faggian, C. (2000). Basic logic: reflection, symmetry, visibility. Journal of Symbolic Logic, 65(3), 979–1013.

    Article  Google Scholar 

  25. Takano, M. (1995). Proof theory for minimal quantum logic: a remark. International Journal of Theoretical Physics, 34(4), 649–654.

    Article  Google Scholar 

  26. Tamura, S. (1988). A Gentzen formulation without the cut rule for ortholattices. Kobe Journal of Mathematics, 5, 133–15-.

Download references

Acknowledgments

We would like to thank anonymous referee for his or her valuable comments and information on the papers [17] and [23]. We would also like to thank Prof. Mitio Takano for his helpful comments on an early version of this paper. This work was supported by JSPS KAKENHI Grant (C) JP26330263.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Norihiro Kamide.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kamide, N. Proof Theory of Paraconsistent Quantum Logic. J Philos Logic 47, 301–324 (2018). https://doi.org/10.1007/s10992-017-9428-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10992-017-9428-z

Keywords

Navigation