scientific article

zbMath0767.03029MaRDI QIDQ3997528

Jörg Hudelmaier

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cut-eliminationlengths of derivationsdecision procedureslengths of proofsefficient decision algorithm for derivability in LIGentzen's sequent calculus LI for intuitionistic propositional logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Related Items

Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi, Correspondences between classical, intuitionistic and uniform provability