Abstract
We present an extension of the first-order logic sequent calculus SK that allows us to systematically add inference rules derived from arbitrary axioms, definitions, theorems, as well as local hypotheses – collectively called assertions. Each derived deduction rule represents a pattern of larger SK-derivations corresponding to the use of that assertion. The idea of metadeduction is to get shorter and more concise formal proofs by allowing the replacement of any assertion in the antecedent of a sequent by derived deduction rules that are available locally for proving that sequent. We prove the soundness and completeness for atomic metadeduction, which builds upon a permutability property for the underlying sequent calculus SK with liberalized δ + + -rule.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Log. Comput. 2(3), 297–347 (1992)
Autexier, S.: The CoRe calculus. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 84–98. Springer, Heidelberg (2005)
Autexier, S., Dietrich, D.: Soundness and weak completeness of proof calculi augmented with derived inference rules restricted to atomic formulas. Seki-Report SR-09-03, DFKI Bremen (2009)
Beckert, B., Hähnle, R., Schmitt, P.H.: The even more liberalized δ-rule in free variable semantic tableaux. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol. 713, pp. 108–119. Springer, Heidelberg (1993)
Brauner, P., Houtmann, C., Kirchner, C.: Principle of superdeduction. In: Ong, L. (ed.) Proceedings of LICS, July 2007, pp. 41–50 (2007)
Burel, G., Kirchner, C.: Cut elimination in deduction modulo by abstract completion. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 115–131. Springer, Heidelberg (2007)
Fiedler, A.: P.rex: An interactive proof explainer. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 416–420. Springer, Heidelberg (2001)
Gentzen, G.: The Collected Papers of Gerhard Gentzen (1934-1938). In: Szabo, M.E. (ed.) North Holland, Amsterdam (1969)
Huang, X.: Human Oriented Proof Presentation: A Reconstructive Approach, Sankt Augustin, Germany. DISKI. Infix, vol. 112 (1996)
Prawitz, D.: Natural deduction; a proof-theoretical study. Stockholm Studies in Philosophy, vol. 3. Almqvist and Wiksells (1965)
Wack, B.: Typage et déduction dans le calcul de réécriture. Thèse de doctorat, Université Henri Poincaré (Nancy 1) (October 2005)
Wirth, C.-P.: Descente infinie + Deduction. Logic J. of the IGPL 12(1), 1–96 (2004)
Wirth, C.-P.: Hilbert’s epsilon as an operator of indefinite committed choice. J. of Applied Logic (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Autexier, S., Dietrich, D. (2009). Atomic Metadeduction. In: Mertsching, B., Hund, M., Aziz, Z. (eds) KI 2009: Advances in Artificial Intelligence. KI 2009. Lecture Notes in Computer Science(), vol 5803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04617-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-04617-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04616-2
Online ISBN: 978-3-642-04617-9
eBook Packages: Computer ScienceComputer Science (R0)