scientific article; zbMATH DE number 3895055

zbMath0562.03027MaRDI QIDQ5187274

V. P. Orevkov

Publication date: 1984

Full work available at URL: https://eudml.org/doc/67617

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

zbMATH Keywords

cut-free proofintuitionistic predicate calculusbounds for lengthening of proofs after cut-eliminationclassical sequential calculus of predicatesderivation- tree of a sequent

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

Related Items (1)

The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem

This page was built for publication: