Skip to main content
SpringerLink
Log in

Extending a logical framework with a modal connective for validity

  • Session 7
  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1281))

Included in the following conference series:

  • 93 Accesses

Abstract

Logical frameworks, formal systems for programming consequence relation based proof systems, are well known. The notations that have been proposed are suited best to natural deduction style presentations based on truth consequence. We develop a conservative extension of a typical logical framework providing a modal connective which we can use to formalise validity. We argue that this extension is sensible, and provide example encodings of non-standard logics in its terms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Avron. Simple consequence relations. Inform. and Comput., 92:105–139, 1991.

    Google Scholar 

  2. A. Avron, F. Honsell, I. Mason, and R. Pollack. Using typed lambda calculus to implement formal systems on a machine. J. Auto. Reas., 9:309–352, 1992.

    Google Scholar 

  3. A. Avron, F. Honsell, M. Miculan, and C. Paravano. Encoding modal logics in logical frameworks. Studia Logica, (to appear).

    Google Scholar 

  4. H. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1992.

    Google Scholar 

  5. D. Basin, S. Matthews, and L. Viganb. Implementing modal and relevance logics in a logical framework. In C. Aiello et al., editors, Proc. KR'96. Morgan-Kaufmann, California, 1996.

    Google Scholar 

  6. D. Basin, S. Matthews, and L. Viganb. Labelled propositional modal logics: theory and practice. J. Logic Computat., (to appear).

    Google Scholar 

  7. I. Cervesato and F. Pfenning. A linear logical framework. In 11th Ann. Symp. Logic in Comp. Sci. IEEE Computer Society Press, I996.

    Google Scholar 

  8. B. Chellas. Modal Logic. Cambridge University Press, New York, 1980.

    Google Scholar 

  9. K. Dosen. Modal logic as metalogic. J. Logic, Language and Information, 1:173–201, 1992.

    Google Scholar 

  10. A. Felty and D. Miller. Specifying theorem provers in a higher-order logic programming language. In E. Lusk and R. Overbeek, editors, Proc. LADE-9. Springer, Berlin, 1988.

    Google Scholar 

  11. G. Gentzen. Untersuchen über das logische Schliessen. Math. Z., 39:179–210, 405–431, 1934.

    Google Scholar 

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

    Google Scholar 

  13. I. Hacking. What is logic? J. Philosophy, 76(6), 1979.

    Google Scholar 

  14. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. J. Assoc. Comput. Mach., 40:143–184, 1993.

    Google Scholar 

  15. G. Hughes and M. Cresswell. Introduction to Modal Logic. Routledge, London, 1972.

    Google Scholar 

  16. S. C. Kleene. Introduction to Metamathematics. North-Holland, Amsterdam, 1952.

    Google Scholar 

  17. S. Matthews. Logical frameworks for relevance and linear logics. Unpublished.

    Google Scholar 

  18. J. C. Mitchell. Type systems for programming languages. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier, Amsterdam, 1990.

    Google Scholar 

  19. R. P. Nederpelt et al., editors. Selected papers on Automath. Elsevier, Amsterdam, 1994.

    Google Scholar 

  20. L. C. Paulson. The foundation of a generic theorem prover. J. Auto. Reas., 5:363–397, 1989.

    Google Scholar 

  21. L. C. Paulson. Isabelle: A Generic Theorem Prover. Springer, Berlin, 1994.

    Google Scholar 

  22. F. Pfenning. Logic programming in the LF logical framework. In G. Huet and G. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.

    Google Scholar 

  23. D. Prawitz. Natural Deduction. Almqvist and Wiksell, Stockholm, 1965.

    Google Scholar 

  24. D. Prawitz. Ideas and results in proof theory. In J. E. Fensted, editor, Proc. Second Scandinavian Logic Symp., pages 235–307. North-Holland, Amsterdam, 1971.

    Google Scholar 

  25. A. K. Simpson. Kripke semantics for a logical framework. In Proc. Workshop on Types for Proofs and Programs, Båstad, 1992. Available from http://www.dcs.ed.ac.uk/home/als/.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Seán Matthews

Authors
  1. Seán Matthews
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martín Abadi Takayasu Ito

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matthews, S. (1997). Extending a logical framework with a modal connective for validity. In: Abadi, M., Ito, T. (eds) Theoretical Aspects of Computer Software. TACS 1997. Lecture Notes in Computer Science, vol 1281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014564

Download citation

  • DOI: https://doi.org/10.1007/BFb0014564

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63388-4

  • Online ISBN: 978-3-540-69530-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation