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 PAT r , which is obtained from the Peano arithmetic PA by adding infinitely many truth predicates.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Beeson, J. Symbolic Logic 43, 2 (1978).
M. Beeson, J. Symbolic Logic 43, 2 (1978).
M. Beeson, Foundations of Constructive Mathematics. Metamathematical Studies (Springer, 1985).
E. Bishop and D. Bridges, Constructive Analysis (Springer, 2011).
E. Bishop, Foundations of Constructive Analysis (Ishi Press, 2012).
S. Feferman, Lecture Notes in Math. 450 (1975).
S. Feferman, Logic Colloquium 78 (Mons., 1979), pp. 159–224.
M. Friedman, Annals of Math. 105, 2 (1977).
F. Kashapova, Soviet Math. Dokl. 29, 3 (1984).
P. Martin-Löf, Logic, Methodology and Philosophy of Science VI (1982), pp. 153–175.
P. Martin-Löf, Intuitionistic Type Theory (Bibliopolis, 1984).
E. Mendelson, Introduction to Mathematical Logic (Chapman and Hall/CRC, 2009).
J. Myhill, J. Symbolic Logic 40, 3 (1973).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kachapova, F. Interpretation of constructive multi-typed theory in the theory of arithmetical truth. Lobachevskii J Math 36, 332–340 (2015). https://doi.org/10.1134/S1995080215040034
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080215040034