Sciweavers

13 search results - page 1 / 3
» On Transforming Intuitionistic Matrix Proofs into Standard-S...
Sort
View
TABLEAUX
1995
Springer
13 years 9 months ago
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
Stephan Schmitt, Christoph Kreitz
LOPSTR
1995
Springer
13 years 9 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
TABLEAUX
1995
Springer
13 years 9 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
IANDC
2000
70views more  IANDC 2000»
13 years 5 months ago
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
Christoph Kreitz, Stephan Schmitt
CIE
2007
Springer
13 years 9 months ago
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
Kentaro Kikuchi