Note on the Benefit of Proof Representations by Name
In mathematical proofs axioms and intermediary results are often represented by their names. It is however undecidable whether such a description corresponds to an underlying proof. This implies that there is sometimes no recursive bound of the complexity of the simplest underlying proof in the complexity of the abstract proof description, i.e. the abstract proof description might be non-recursively simpler.
- Aguilera, J. P., & Baaz, M. (2018). Unsound inferences make proofs shorter. arXiv preprint arXiv:1608.07703, to appear in the Journal of Symbolic Logic.Google Scholar
- Bourbaki, N. (2013). General topology: Chapters 1–4 (Vol. 18). Springer Science & Business Media, London, New York.Google Scholar
- Hilbert, D. (1899). Grundlagen der Geometrie. Teubner.Google Scholar
- Mac Lane, S. (1934). Abgekürzte Beweise im Logikkalkül. Hubert.Google Scholar
- Orevkov, V. P. (1984). Reconstitution of the proof from its scheme (russian abstract). 8th Soviet Conference on Mathematical Logic. Novosibirsk (p. 133).Google Scholar
- Takeuti, G. (1975). Proof Theory 2nd edition (2003) Dover Publications Mineola New York.Google Scholar