Abstract
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline some work we have done using the proof-assistant Isabelle to machine-check aspects of proof theory in general, and specifically the proof theory of provability logic GL.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dawson, J.E., Goré, R.: Formalised Cut Admissibility for Display Logic. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 131–147. Springer, Heidelberg (2002)
Goré, R., Ramanayake, R.: Valentini’s Cut Elimination for Provability Logic Resolved. In: Advances in Modal Logic, vol. 7, pp. 67–86. College Publications, London (2008)
Leivant, D.: On the Proof Theory of the Modal Logic for Arithmetic Provability. Journal of Symbolic Logic 46, 531–538 (1981)
Mints, G.: Cut elimination for provability logic. Collegium Logicum (2005)
Moen, A.: The proposed algorithms for eliminating cuts in the provability calculus GLS do not terminate. In: NWPT 2001, Norwegian Computing Center, December 10 (2001), http://publ.nr.no/3411
Negri, S.: Proof Analysis in Modal Logic. Journal of Philosophical Logic 34, 507–544 (2005)
Solovay, R.M.: Provability Interpretations of Modal Logic. Israel Journal of Mathematics 25, 287–304 (1976)
Valentini, S.: The Modal Logic of Provability: Cut-elimination. Journal of Philosophical Logic 12, 471–476 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goré, R. (2008). Machine Checking Proof Theory: An Application of Logic to Logic. In: Ramanujam, R., Sarukkai, S. (eds) Logic and Its Applications. ICLA 2009. Lecture Notes in Computer Science(), vol 5378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92701-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-92701-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92700-6
Online ISBN: 978-3-540-92701-3
eBook Packages: Computer ScienceComputer Science (R0)