Sciweavers

204 search results - page 1 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
TABLEAUX
1995
Springer
13 years 8 months ago
A Connection Based Proof Method for Intuitionistic Logic
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
Jens Otten
LOPSTR
1995
Springer
13 years 8 months ago
Guiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...
Christoph Kreitz, Jens Otten, Stephan Schmitt
CADE
1997
Springer
13 years 9 months ago
Connection-Based Proof Construction in Linear Logic
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
Christoph Kreitz, Heiko Mantel, Jens Otten, Stepha...
WOLLIC
2009
Springer
13 years 11 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
CADE
2001
Springer
14 years 5 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
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 expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...