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

DOI10.1007/s10958-023-06671-zOpenAlexW4387220413MaRDI QIDQ6147867

V. P. Orevkov

Publication date: 1 February 2024

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

Full work available at URL: https://doi.org/10.1007/s10958-023-06671-z

Mathematics Subject Classification ID

General logic (03Bxx) Mathematical logic and foundations (03-XX) Proof theory and constructive mathematics (03Fxx)

Cites Work

• Upper bound on the height of terms in proofs with bound-depth-restricted cuts
• Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
• Bounds for proof-search and speed-up in the predicate calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper and lower bounds for the height of proofs in sequent calculus for intuitionistic logic