Skip to main content
Springer Nature Link
Log in

Formalisation vs. Understanding

A Case Study in Isabelle

  • Conference paper
  • First Online:
Unconventional Computation and Natural Computation (UCNC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9252))

Abstract

We discuss how formalisation using proof assistants, an unconventional way of doing mathematics which seems to disregard Gödel’s celebrated Incompleteness Theorems, interacts with ideas of understanding. Our experience is based on a formalisation carried out in the Isabelle generic proof assistant.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Our thanks to a reviewer for highlighting this unconventional view of proofs.

  2. 2.

    http://www.jedit.org/.

References

  1. Isabelle hompage. http://isabelle.in.tum.de/

  2. Ballarin, C., Belgrade 2008 - Tutorial: Introduction to the proof assistant. http://www21.in.tum.de/ ballarin/belgrade08-tut/

  3. Calude, C.S., Desfontaines, D.: Universality and almost decidability. Fundamenta Informaticae 21, 1001–1006 (2014)

    Google Scholar 

  4. Calude, C.S., Müller, C.: Formal proof: reconciling correctness and understanding. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) MKM 2009, Held as Part of CICM 2009. LNCS, vol. 5625, pp. 217–232. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Gordon, M.: From LCF to HOL: a short history. In: Plotkin, G., Stirling, C.P., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 169–186. MIT Press, Cambridge (2000)

    Google Scholar 

  6. Nipkow, T.: Programming and proving in Isabelle/HOL (2013)

    Google Scholar 

  7. OED Online. proof, n. http://www.oed.com/view/Entry/152578?rskey=bJkM38, October 2014

  8. Xu, J., Zhang, X., Urban, C.: Mechanising turing machines and computability theory in Isabelle/HOL. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 147–162. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Acknowledgements

Special thanks is given to Cris Calude for his generous advice, guidance and help. Thanks is also given to Robert Drummond, Mostafa Raziebrahimsaraei and Marcus Triplett for useful discussions on issues encountered during formalisation, and to the anonymous reviewers for helpful comments.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    Declan Thompson

Authors
  1. Declan Thompson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Declan Thompson .

Editor information

Editors and Affiliations

  1. University of Auckland, Auckland, New Zealand

    Cristian S. Calude

  2. University of Auckland, Auckland, New Zealand

    Michael J. Dinneen

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Thompson, D. (2015). Formalisation vs. Understanding. In: Calude, C., Dinneen, M. (eds) Unconventional Computation and Natural Computation. UCNC 2015. Lecture Notes in Computer Science(), vol 9252. Springer, Cham. https://doi.org/10.1007/978-3-319-21819-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21819-9_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21818-2

  • Online ISBN: 978-3-319-21819-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics