Abstract
This paper considers an axiomatic theory BT, which can be used to formalise constructive mathematics. BT has an intuitionistic logic, combinatorial operations and sets of many types. BT has such constructive features as a predicative comprehension axiom and consistency with the formal Church thesis but BT is also consistent with classical logic. In addition to the properties of BT studied before, in this paper we study the proof-theoretical strength of BT and its fragments by constructing an interpretation of BT in a so called theory of arithmetical truth PATr, which is obtained from the Peano arithmetic PA by adding infinitely many truth predicates.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
