Abstract
We present a sequent calculus which allows the simultaneous elimination of multiple quantifiers. The approach is an improvement over the well-known skolemization in sequent calculus. It allows a lazy handling of instantiations and of the order of certain reductions. Simultaneous quantifier elimination is justified from a semantical as well as from a proof theoretical point of view.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Autexier and H. Mantel. Semantical Investigation of Simultaneous Skolemization for First-Order Sequent Calculus, Seki Report SR-98-05, 1998.
A. Avron. Simple Consequence Relations, In Information and Computation 92, p. 105–139, 1991.
W. Bibel. Automated Theorem Proving. Vieweg Verlag, 2nd edition, 1987.
K. A. Bowen. Programming with full first-order logic, In Hayes, Michie, Pao, Eds., Machine Intelligence 10, 1982.
J. Crow, S. Owre, J. Rushby, N. Shankar and M. Srivas. A Tutorial Introduction to PVS, Presented at WIFT’95, 1995.
G. Gentzen. Untersuchungen über das logische Schließen, Mathematische Zeitschrift. 39:179–210 and 405–431, 1935.
D. Hutter, B. Langenstein, C. Sengler, J. Siekmann, W. Stephan and A. Wolpers. Verification Support Environment (VSE), High Integrity Systems, p. 523–530, 1996.
J. Ketonen and R. Weyhrauch. A Decidable Fragment of Predicate Calculus, In TCS, Volume 32–3, 1984.
P. Lincoln and N. Shankar. Proof Search in First-Order Linear Logic and other Cut-Free Sequent Calculi, In Proceedings of 9th LICS, p. 282–291, 1994.
J. Loeckx, H.-D. Ehrich and M. Wolf. Specification of Abstract Data Types, Wiley-Teubner, 1996.
L.C. Paulson. Isabelle, A Generic Theorem Prover, Springer Verlag, 1994.
N. Shankar. Proof Search in the Intuitionistic Sequent Calculus, In D. Kapur, Ed., Proceedings of CADE-11, p. 522–536, 1992.
T. Skolem. Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze, In Skrifter utgit av Videnskapselskapet i Kristiania, p. 4–36, 1920.
L. Wallen. Automated Deduction in Non-Classical Logic. MIT Press, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Autexier, S., Mantel, H., Stephan, W. (1998). Simultaneous quantifier elimination. In: Herzog, O., Günter, A. (eds) KI-98: Advances in Artificial Intelligence. KI 1998. Lecture Notes in Computer Science, vol 1504. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095435
Download citation
DOI: https://doi.org/10.1007/BFb0095435
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65080-5
Online ISBN: 978-3-540-49656-4
eBook Packages: Springer Book Archive