Epi-constructivism: Decidable sets of computable numbers as foundational objects for mathematics
Zvi Schreiber

TL;DR
This paper explores a foundational approach to mathematics using decidable sets of computable real numbers, aiming for an explicit, enumerable class of numbers that can be constructively handled.
Contribution
It introduces the concept of decidable constructive real numbers and investigates classes of such numbers as foundational objects for epi-constructionist mathematics.
Findings
Identifies classes of decidable computable real numbers.
Proposes a framework for foundational mathematics based on enumerable real numbers.
Addresses decidability issues in constructive real number definitions.
Abstract
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach to mathematics. While most constructive mathematics is concerned with constructive proofs, the agenda here is that the objects that we study, specifically the class of numbers that we study, should be an enumerable set of finite symbol strings. These might also be called decidable constructive real numbers, that is our class of numbers should be a computable sets of explicitly represented computable numbers. There have been various investigations of the computable numbers going back to Turing. Most are however not expressed constructively, rather computable is a property assigned to some of the abstract real numbers. Other definitions define…
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
TopicsComputability, Logic, AI Algorithms
