Skip to main content
SpringerLink
Log in

Formalised Cut Admissibility for Display Logic

  • Conference paper
  • First Online:
Theorem Proving in Higher Order Logics (TPHOLs 2002)

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

Included in the following conference series:

Abstract

We use a deep embedding of the display calculus for relation algebras δRA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for δRA. Unlike other “implementations”, we explicitly formalise the structural induction in Isabelle/HOL and believe this to be the first full formalisation of cut-admissibility in the presence of explicit structural rules.

Supported by an Australian Research Council Large Grant

Supported by an Australian Research Council QEII Fellowship

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. N D Belnap. Display logic. Journal of Philosophical Logic, 11:375–417, 1982.

    MathSciNet  MATH  Google Scholar 

  2. Jeremy E Dawson and R Goré. Embedding display calculi into logical frameworks: Comparing Twelf and Isabelle. In C Fidge (Ed), Proc. CATS 2001: The Australian Theory Symposium, ENTCS, 42: 89–103, 2001, Elsevier.

    Google Scholar 

  3. J E. Dawson and R Gore. A new machine-checked proof of strong normalisation for display logic. Submitted 2001.

    Google Scholar 

  4. R Goré. Cut-free display calculi for relation algebras. In D van Dalen and M Bezem (Eds), CSL’96: Selected Papers of the Annual Conference of the European Association for Computer Science Logic, LNCS 1258:198–210. Springer, 1997.

    Google Scholar 

  5. R Goré. Substructural logics on display. Logic Journal of the Interest Group in Pure and Applied Logic, 6(3):451–504, 1998.

    MATH  Google Scholar 

  6. J Harrison. Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI International Cambridge Computer Science Research Centre, 1995.

    Google Scholar 

  7. S Matthews. Implementing FS0 in Isabelle: adding structure at the metalevel. In J Calmet and C Limongelli, editors, Proc. Disco’96. Springer, 1996.

    Google Scholar 

  8. A Mikhajlova and J von Wright. Proving isomorphism of first-order proof systems in HOL. In J Grundy and M Newey, editors, Theorem Proving in Higher-Order Logics, LNCS 1479:295–314. Springer, 1998.

    Chapter  Google Scholar 

  9. F Pfenning. Structural cut elimination. In Proc. LICS 94, 1994.

    Google Scholar 

  10. C Schürmann. Automating the Meta Theory of Deductive Systems. PhD thesis, Dept. of Comp. Sci., Carnegie Mellon University, USA, CMU-CS-00-146, 2000.

    Google Scholar 

  11. H Wansing. Displaying Modal Logic, volume 3 of Trends in Logic. Kluwer Academic Publishers, Dordrecht, August 1998.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automated Reasoning Group, Australian National University, Canberra, ACT, 0200, Australia

    Jeremy E. Dawson & Rajeev Goré

Authors
  1. Jeremy E. Dawson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Goré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. NASA Langley Research Center, MS 130, Hampton, VA, 23681, USA

    Victor A. Carreño

  2. ICASE-Langley Research Center, MS 132C, Hampton, VA, 23681, USA

    César A. Muñoz

  3. Electrical and Computer Engineering, Concordia University, 1455 de Maisonneuve Blvd.W., Montréal, Québec, H3G 1M8, Canada

    Sofiène Tahar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dawson, J.E., Goré, R. (2002). Formalised Cut Admissibility for Display Logic. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45685-6_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45685-6_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44039-0

  • Online ISBN: 978-3-540-45685-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation