Skip to main content

A Computational Interpretation of Modal Proofs

  • Chapter
Proof Theory of Modal Logic

Part of the book series: Applied Logic Series ((APLS,volume 2))

Abstract

Proof theory of modal logics, though largely studied since the fifties, has always been a delicate subject, the main reason being the apparent impossibility to obtain elegant, natural systems for intensional operators (with the excellent exception of intuitionistic logic). For example Segerberg, not earlier than 1984 [5], observed that the Gentzen format, which works so well for truth functional and intuitionistic operators, cannot be a priori expected to remain valid for modal logics; carrying to the limit this observation one could even assert that ‘logics with no good proof theory are unnatural.’ In such a way we should mark as ‘unnatural’ all modal logics (with great delight of a large number of logicians!).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Barendregt. The Lambda Calculus: its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics. North-Holland, 1984. Revised Edition.

    Google Scholar 

  2. H. Barendregt. Lambda calculus with types. In: S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, (eds.), Handbook of Logic in Computer Science, Vol. II Background: Computational Structures, pp. 118–310. Oxford University Press, 1992.

    Google Scholar 

  3. M. R. F. Benevides, T. S. E. Maibaum. A constructive presentation for the modal connective of necessity (0). Journal of Logic and Computation, 2, 31–50, 1992.

    Article  Google Scholar 

  4. G. Bierman, C. Mere, V. de Paiva. Intuitionistic necessity revisited. In: Logic at Work: Applied Logic Conference, 1992.

    Google Scholar 

  5. R. Bull, K. Segerberg. Basic modal logic. In: D. Gabbay, F. Guenthner, (eds.), Handbook of Philosophical Logic, Vol. II, pp. 1–88. Reidel, 1984.

    Google Scholar 

  6. K. Dolen. Sequent-systems for modal logic. Journal of Symbolic Logic, 50, 149–168, 1985.

    Article  Google Scholar 

  7. D. M. Gabbay, R. J.G.B. de Queiroz. Extending the Curry-Howard interpretation to linear, relevant and other resource logics. Journal of Symbolic Logic, 57, 1319–1365, 1992.

    Article  Google Scholar 

  8. D. M. Gabbay, R. J.G.B. de Queiroz. An introduction to labelled natural deduction. Proceedings of Third Advanced Summer School in Artificial Intelligence, 1992.

    Google Scholar 

  9. J.-Y. Girard. Proof Theory and Logical Complexity. Bibliopolis, 1987.

    Google Scholar 

  10. S. Kripke. Semantical analysis of modal logic I. Zeitschr f. math. Logik and Grund. d. Mathematik, 9, 67–96, 1963.

    Article  Google Scholar 

  11. A. Masini. 2-Sequent calculus: A proof theory of modalities. Annals of Pure and Applied Logic, 58, 229–246, 1992.

    Article  Google Scholar 

  12. A. Masini. 2-sequent calculus: Intuitionism and natural deduction. Journal of - Log ic and Computation, 3, 533–562, 1993.

    Article  Google Scholar 

  13. G. Mints. Selected Papers in Proof Theory. Bibliopolis, 1992.

    Google Scholar 

  14. D. Prawitz. Natural Deduction. Acta Universitatis Stockholmiensis, Stockholm Studies in Philosophy 3, Almqvist & Wiksell, Stockholm, 1965.

    Google Scholar 

  15. A. S. Troelstra. Natural deduction for intuitionistic linear logic. Annals of Pure and Applied Logic, 73, 79–108, 1995.

    Article  Google Scholar 

  16. A. S. Troelstra and Dirk van Dalen. Constructivism in Mathematics, Vol. II. North-Holland, 1988.

    Google Scholar 

  17. H. Wansing. Sequent calculi for normal modal propositional logic. Journal of Logic and Computation, 4, 125–142, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Martini, S., Masini, A. (1996). A Computational Interpretation of Modal Proofs. In: Wansing, H. (eds) Proof Theory of Modal Logic. Applied Logic Series, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2798-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-2798-3_12

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4720-5

  • Online ISBN: 978-94-017-2798-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics