Upper bound on the height of terms in proofs with bound-depth-restricted cuts

DOI10.1023/A:1025601406752zbMath1072.03009MaRDI QIDQ2487392

B. Yu. Konev

Publication date: 5 August 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07) Complexity of proofs (03F20)

Related Items (1)

Upper and lower bounds for the height of proofs in sequent calculus for intuitionistic logic

This page was built for publication: Upper bound on the height of terms in proofs with bound-depth-restricted cuts