On the Difficulty of Writing Out formal Proofs in Arithmetic

DOI10.1002/MALQ.19970430305zbMath0880.03031OpenAlexW2045087020MaRDI QIDQ4351922

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

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

Mathematics Subject Classification ID

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

Cites Work

• Self-reference and modal logic

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