Publication:4283227
From MaRDI portal
zbMath0794.03076MaRDI QIDQ4283227
Publication date: 28 August 1994
sequent calculi; second-order unification; algorithmic solvability; linear proofs; semi-unification; \(k/l\)-compressibility; algorithmic structuring of proofs; proofs in tree form
03B25: Decidability of theories and sets of sentences
03B35: Mechanization of proofs and logical operations
03F05: Cut-elimination and normal-form theorems
03F20: Complexity of proofs
Related Items
Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness, Algorithmic introduction of quantified cuts, On partial and paraconsistent logics, Generalizing proofs in monadic languages (with a postscript by Georg Kreisel)., Generalizing theorems in real closed fields, Physics and proof theory