123 search results - page 6 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine...
AIMSA
1998
Springer
15 years 1 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
BIRTHDAY
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
JSYML
2008
14 years 9 months ago
2008
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
TLCA
2005
Springer
15 years 3 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...