Arithmetic, Infinite Trees, and Second-order Subsystems: Notes and Observations
David M. Cerna
TL;DR
This paper explores alternative formalizations of arithmetic, focusing on the use of infinite trees and second-order subsystems, providing insights into their theoretical properties and potential applications.
Contribution
It introduces new perspectives on formalizing arithmetic using infinite trees and second-order systems, advancing the understanding of their foundational aspects.
Findings
Different formalizations of arithmetic are compared.
Infinite trees offer a novel approach to modeling arithmetic.
Second-order subsystems reveal new logical properties.
Abstract
Work in progress concerning alternative formalizations of arithmetic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications