Complexity bounds on proofs
From MaRDI portal
Publication:3922673
DOI10.2307/2273619zbMath0469.03041OpenAlexW2092556683MaRDI QIDQ3922673
William S. Hatcher, Bernard R. Hodgson
Publication date: 1981
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273619
Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Cites Work
This page was built for publication: Complexity bounds on proofs