Abstract
A system with variable splitting is introduced for a sequent calculus with free variables and run-time Skolemization. Derivations in the system are invariant under permutation, so that the order in which rules are applied has no effect on the leaves. Technically this is achieved by means of a simple indexing system for formulae, variables and Skolem functions. Moreover, the way in which variables are split enables us to restrict the term universe branchwise.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antonsen, R.: Free variable sequent calculi. Master’s thesis, University of Oslo, Language, Logic and Information, Department of Linguistics (May 2003)
Baaz, M., Fermüller, C.G.: Non-elementary speedups between different versions of tableaux. In: Peter Baumgartner, R.H., Possega, J. (eds.) TABLEAUX 1995. LNCS (LNAI), vol. 918, pp. 217–230. Springer, Heidelberg (1995)
Beckert, B., Hähnle, R.: An improved method for adding equality to free variable semantic tableaux. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 507–521. Springer, Heidelberg (1992)
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)
Bibel, W.: Computationally improved versions of Herbrand’s theorem. In: Logic Colloquium 1981, pp. 11–28. North-Holland, Amsterdam (1982)
Bibel, W.: Automated Theorem Proving, 2nd edn. Vieweg Verlag (1987)
Fitting, M.C.: First-Order Logic and Automated Theorem Proving. In: Graduate Texts in Computer Science, 2nd edn., Springer, Berlin (1996); 1st edn., 1990
Hähnle, R., Schmitt, P.H.: The liberalized δ-rule in free variable semantic tableaux. Journal of Automated Reasoning 13(2), 211–222 (1994)
Kreitz, C., Otten, J.: Connection-based theorem proving in classical and nonclassical logics. Journal of Universal Computer Science 5(3), 88–112 (1999)
Smullyan, R.M.: First-Order Logic. In: Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 43. Springer, New York (1968)
Waaler, A.: Connections in nonclassical logics. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, ch. 22, pp. 1487–1578. Elsevier Science, Amsterdam (2001)
Waaler, A., Antonsen, R.: A free variable sequent calculus with uniform variable splitting. Research Report 305, Department of Informatics, University of Oslo (June 2003)
Wallen, L.A.: Automated deduction in nonclassical logics. MIT Press, Cambridge (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waaler, A., Antonsen, R. (2003). A Free Variable Sequent Calculus with Uniform Variable Splitting. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45206-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40787-4
Online ISBN: 978-3-540-45206-5
eBook Packages: Springer Book Archive