Abstract
JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver’s proof technique, the generation of proof objects, and its integration into the Nuprl proof development system.
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
Preview
Unable to display preview. Download preview PDF.
References
S. Allen, R. Constable, R. Eaton, C. Kreitz & L. Lorigo. The Nuprl open logical environment. In D. McAllester, ed., CADE-17, LNAI 1831, pages 170–176. Springer, 2000.
C. Benzmüller et. al. Ωmega: Towards a mathematical assistant. In W. McCune, ed., CADE-14, LNAI 1249, pages 252–256. Springer, 1997.
W. Bibel. Automated Theorem Proving. Vieweg, 1987
R. L. Constable et. al. Implementing Mathematics with the Nuprl proof development system. Prentice Hall, 1986.
U. Egly & S. Schmitt. On intuitionistic proof transformations, their complexity, and application to constructive program synthesis. Fundamenta Informaticae 39(1-2): 59–83, 1999.
M. C. Fitting. Intuitionistic logic, model theory and forcing. Studies in logic and the foundations of mathematics. North-Holland, 1969.
G. Gentzen. Untersuchungenüber das logische Schlieβen. Mathematische Zeitschrift, 39:176–210, 405-431, 1935.
J. Hickey & A. Nogin. Fast tactic-based theorem proving. In J. Harrison & M. Aagaard, eds., TPHOLs 2000, LNCS 1869, pages 252–266. Springer, 2000.
Jason J. Hickey, Aleksey Nogin, et al. MetaPRL home page. http://metaprl.org/.
C. Kreitz & J. Otten. Connection-based theorem proving in classical and non-classical logics. Journal for Universal Computer Science 5(3):88–112, 1999.
C. Kreitz & S. Schmitt. A uniform procedure for converting matrix proofs into sequent-style systems. Journal of Information and Computation 162(1-2):226–254, 2000.
C. Kreitz & B. Pientka. Matrix-based inductive theorem proving. In R. Dyckhoff, ed., TABLEAUX-2000, LNAI 1847, pages 294–308. Springer, 2000.
The MathBus Term Structure. http://www.cs.cornell.edu/simlab/papers/mathbus/mathTerm.htm
J. Otten & C. Kreitz. T-string-unification: unifying prefixes in non-classical proof methods. In U. Moscato, ed., TABLEAUX’96, LNAI 1071, pages 244–260. Springer, 1996.
S. Schmitt. Proof reconstruction in classcial and non-classical logics, Dissertationen zur Künstlichen Intelligenz 239. Infix, 2000.
S. Schmitt. A tableau-like representation framework for efficient proof reconstruction. In R. Dyckhoff, ed., TABLEAUX-2000, LNAI 1847, pages 398–414. Springer, 2000.
K. Slind, M. Gordon, R. Boulton & A. Bundy. An interface between CLAM and HOL. In C. Kirchner & H. Kirchner, eds., CADE-15, LNAI 1421, pages 134–138. Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmitt, S., Lorigo, L., Kreitz, C., Nogin, A. (2001). JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_34
Download citation
DOI: https://doi.org/10.1007/3-540-45744-5_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42254-9
Online ISBN: 978-3-540-45744-2
eBook Packages: Springer Book Archive