Abstract
The decidability of the implicational fragment \(T_{\rightarrow }\) of the relevance logic of ticket entailment was recently claimed independently by Bimbó and Dunn, and Padovani. We present a mechanised formalisation, in Isabelle/HOL, of the various proof-theoretical results due to Bimbó and Dunn that underpin their claim. We also discuss the issues that stymied our attempt to verify their proof of decidability.
J.E. Dawson—Supported by Australian Research Council Discovery Grant DP120101244.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bimbó, K., Dunn, J.M.: New consecution calculi for \({R}_{\rightarrow }^{\mathbf{t}}\). Notre Dame J. Formal Logic 53(4), 491–509 (2012)
Bimbó, K., Dunn, J.M.: On the decidability of implicational ticket entailment. J. Symb. Logic 78(1), 214–236 (2013)
Dawson, J.E., Clouston, R., Goré, R., Tiu, A.: From display calculi to deep nested sequent calculi: formalised for full intuitionistic linear logic. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 250–264. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44602-7_20
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). doi:10.1007/3-540-45685-6_10
Dawson, J.E., Goré, R.: Generic methods for formalising sequent calculi applied to provability logic. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 263–277. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16242-8_19
Dunn, J.M.: (abstract only) A ‘Gentzen system’ for positive relevant implication. J. Symb. Logic 38, 356–357 (1973)
Goré, R.: Machine checking proof theory: an application of logic to logic. In: Ramanujam, R., Sarukkai, S. (eds.) ICLA 2009. LNCS, vol. 5378, pp. 23–35. Springer, Heidelberg (2008). doi:10.1007/978-3-540-92701-3_2
Goré, R., Ramanayake, R.: Valentini’s cut-elimination for provability logic resolved. Rew. Symb. Logic 5(2), 212–238 (2012)
Padovani, V.: Ticket entailment is decidable. CoRR, abs/1106.1875 (2011)
Acknowledgements
We are grateful to Katalin Bimbó, Michael Dunn and John Slaney for their helpful comments. All remaining errors are our own.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dawson, J.E., Goré, R. (2017). Issues in Machine-Checking the Decidability of Implicational Ticket Entailment. In: Schmidt, R., Nalon, C. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2017. Lecture Notes in Computer Science(), vol 10501. Springer, Cham. https://doi.org/10.1007/978-3-319-66902-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-66902-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66901-4
Online ISBN: 978-3-319-66902-1
eBook Packages: Computer ScienceComputer Science (R0)