Complexity bounds on proofs

DOI10.2307/2273619MaRDI QIDQ3922673zbMATH OpenOpenAlexFDO

Authors William S. Hatcher, Bernard 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

zbMATH Keywords

proof theory

Mathematics Subject Classification ID

Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

Cites work

• Diophantine Representation of the Set of Prime Numbers

This page was built for publication: Complexity bounds on proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922673)