Abstract
We present a mechanised formalisation, in Isabelle/HOL, of Brotherston and Goré’s proof of Craig interpolation for a large of class display calculi for various propositional substructural logics. Along the way, we discuss the particular difficulties associated with the local interpolation property for various rules, and some important differences between our proofs and those of Brotherston and Goré, which are motivated by the ease of mechanising the development. Finally, we discuss the value for this work of using a prover with a programmable user interface (here, Isabelle with its Standard ML interface).
J.E. Dawson—Supported by Australian Research Council Discovery Grant DP120101244.
J. Brotherston—Supported by an EPSRC Career Acceleration Fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In Lemma 3.9 [3] this set of rules is the set of AD rules.
References
Isabelle/HOL mechanisation of our interpolation proofs. http://users.cecs.anu.edu.au/ jeremy/isabelle/2005/interp/
Belnap, N.D.: Display logic. J. Philos. Logic 11, 375–417 (1982)
Brotherston, J., Goré, R.: Craig interpolation in displayable logics. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS, vol. 6793, pp. 88–103. Springer, Heidelberg (2011)
Buss, S.R.: Introduction to proof theory. In: Handbook of Proof Theory, chap. I. Elsevier Science (1998)
Caniart, N.: Merit: an interpolating model-checker. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 162–166. Springer, Heidelberg (2010)
Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic 22(3), 269–285 (1957)
Dawson, J.E., Goré, R.P.: 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)
Dawson, J.E., Goré, R.: Generic methods for formalising sequent calculi applied to provability logic. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 263–277. Springer, Heidelberg (2010)
Feferman, S.: Harmonious logic: craigs interpolation theorem and its descendants. Synthese 164, 341–357 (2008)
Goré, R.P.: Machine checking proof theory: an application of logic to logic. In: Ramanujam, R., Sarukkai, S. (eds.) ICLA 2009. LNCS (LNAI), vol. 5378, pp. 23–35. Springer, Heidelberg (2009)
McMillan, K.L.: Quantified invariant generation using an interpolating saturation prover. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 413–427. Springer, Heidelberg (2008)
Acknowledgements
We are grateful for the many comments from the IJCAR reviewers, which have improved the paper considerably.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Dawson, J.E., Brotherston, J., Goré, R. (2016). Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi. In: Olivetti, N., Tiwari, A. (eds) Automated Reasoning. IJCAR 2016. Lecture Notes in Computer Science(), vol 9706. Springer, Cham. https://doi.org/10.1007/978-3-319-40229-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-40229-1_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40228-4
Online ISBN: 978-3-319-40229-1
eBook Packages: Computer ScienceComputer Science (R0)