Abstract
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. J. ACM 48(1), 70–109 (2001)
Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A.W., Winkowski, J. (eds.) Concurrency Theory. LNCS, vol. 1243, pp. 135–150. Springer, Heidelberg (1997)
Dowek, G., Jiang, Y.: Cut-elimination and the decidability of reachability in alternating pushdown systems (2014). arXiv:1410.8470 [cs.LO]
Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symb. Log. 57(3), 795–807 (1992)
Dyckhoff, R., Lengrand, S.: LJQ: a strongly focused calculus for intuitionistic logic. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 173–185. Springer, Heidelberg (2006)
Dyckhoff, R., Negri, S.: Admissibility of structural rules for contraction-free systems of intuitionistic logic. J. Symb. Log. 65, 1499–1518 (2000)
Girard, J.-Y.: Locus solum. Math. Struct. Comput. Sci. 11, 301–506 (2001)
Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)
Frühwirth, T., Shapiro, E., Vardi, M., Yardeni, E.: Logic programs as types for logic programs. In: Logic in Computer Science, pp. 300–309 (1991)
Goubault-Larrecq, J.: Deciding H\(_1\) by resolution. Inf. Process. Lett. 95(3), 401–408 (2005)
Hudelmaier, J.: An \(O(n \log n)\)-space decision procedure for intuitionistic propositional logic. J. Log. Comput. 3, 63–76 (1993)
Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)
McAllester, D.A.: Automatic recognition of tractability in inference relations. J. ACM 40(2), 284–303 (1993)
Prawitz, D.: Natural Deduction. Almqvist & Wiksell, Stockholm (1965)
Vorob’ev, N.N.: A new algorithm for derivability in the constructive propositional calculus. Am. Math. Soc. Transl. 2(94), 37–71 (1970)
Acknowledgements
This work is supported by the ANR-NSFC project LOCALI (NSFC 61161130530 and ANR 11 IS02 002 01) and the Chinese National Basic Research Program (973) Grant No. 2014CB340302.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dowek, G., Jiang, Y. (2015). Decidability, Introduction Rules and Automata. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2015. Lecture Notes in Computer Science(), vol 9450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48899-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-48899-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48898-0
Online ISBN: 978-3-662-48899-7
eBook Packages: Computer ScienceComputer Science (R0)