On the Difficulty of Writing Out formal Proofs in Arithmetic

DOI10.1002/MALQ.19970430305MaRDI QIDQ4351922zbMATH OpenOpenAlexFDO

Authors Ryo Kashima, Takeshi Yamaguchi

Publication date 11 January 1998

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19970430305

zbMATH Keywords

\(m\)-complete setformal proofs in arithmeticGödel's incompleteness theoremprimitive recursive arithmetic

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 3912360
• On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics
• A Note on the Length of Proofs

Cites work

• Self-reference and modal logic

Cited in

(1)

• How to write a 21\(^{\text{st}}\) century proof

This page was built for publication: On the Difficulty of Writing Out formal Proofs in Arithmetic

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