Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-02T19:54:33.909Z Has data issue: false hasContentIssue false
  • English
  • Français

TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES

Published online by Cambridge University Press:  23 October 2018

GERHARD JÄGER ,
TIMOTEJ ROSEBROCK  and
SATO KENTARO
GERHARD JÄGER
Affiliation:
INSTITUTE OF COMPUTER SCIENCE UNIVERSITY OF BERN NEUBRÜCKSTRASSE 10, 3012BERN, SWITZERLAND E-mail: [email protected]
TIMOTEJ ROSEBROCK
Affiliation:
INSTITUTE OF COMPUTER SCIENCE UNIVERSITY OF BERN NEUBRÜCKSTRASSE 10, 3012BERN, SWITZERLAND E-mail: [email protected]
SATO KENTARO
Affiliation:
INSTITUTE OF COMPUTER SCIENCE UNIVERSITY OF BERN NEUBRÜCKSTRASSE 10, 3012BERN, SWITZERLAND E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

BON+ is an applicative theory and closely related to the first order parts of the standard systems of explicit mathematics. As such it is also a natural framework for abstract computations. In this article we analyze this aspect of BON+ more closely. First a point is made for introducing a new operation τN, called truncation, to obtain a natural formalization of partial recursive functions in our applicative framework. Then we introduce the operational versions of a series of notions that are all equivalent to semi-decidability in ordinary recursion theory on the natural numbers, and study their mutual relationships over BON+ with τN.

Keywords

03B4003D2503D7503E1503F99applicative theoriesexplicit mathematicsabstract computability(semi-) decidabilityKleene’s second modelgraph modelHausdorff–Kuratowski difference hierarchy
Type
Articles
Information
The Journal of Symbolic Logic , Volume 83 , Issue 3 , September 2018 , pp. 967 - 990
Copyright
Copyright © The Association for Symbolic Logic 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Barendregt, H. P., The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1985.Google Scholar
Beeson, M. J., Foundations of Constructive Mathematics: Metamathematical Studies, Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 3/6, Springer, Berlin, 1985.CrossRefGoogle Scholar
Feferman, S., A language and axioms for explicit mathematics, Algebra and Logic (Crossley, J. N., editor), Lecture Notes in Mathematics, vol. 450, Springer, Berlin, 1975, pp. 87–139.CrossRefGoogle Scholar
Feferman, S., Constructive theories of functions and classes, Logic Colloquium ’78 (Boffa, M., van Dalen, D., and McAloon, K., editors), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam, 1979, pp. 159–224.Google Scholar
Feferman, S. and Jäger, G., Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic, vol. 65 (1993), no. 3, pp. 243–263.CrossRefGoogle Scholar
Feferman, S., Jäger, G., and Strahm, T., Foundations of explicit mathematics, in preparation.Google Scholar
Hinman, P. G., Recursion-Theoretic Hierarchies, Perspectives in Mathematical Logic, vol. 9, Springer, Berlin, 1978.CrossRefGoogle Scholar
Kahle, R., Applikative Theorien und Frege-Strukturen, Ph.D. thesis, Institut für Informatik und angewandte Mathematik, Universität Bern, 1997.Google Scholar
Kahle, R., N-strictness in applicative theories, Archive for Mathematical Logic, vol. 39 (2000), no. 2, pp. 125–144.CrossRefGoogle Scholar
Kanamori, A., The Higher Infinite: Large Cardinals in Set Theory from Their Beginnings, Springer, Berlin, 2003.Google Scholar
Longley, J. and Normann, D., Higher-Order Computability, Springer, Berlin, 2015.CrossRefGoogle Scholar
Louvau, A., Some results in the Wadge hierarchy of Borel sets, Cabal Seminar 79–81 (Kechris, A. S., Martin, D. A., and Moschovakis, Y. N., editors), Lecture Notes in Mathematics, vol. 1019, Springer, Berlin, 1983, pp. 28–55.CrossRefGoogle Scholar
Montalbán, A. and Shore, R. A., The limits of determinacy in second order arithmetic, Proceedings of the London Mathematical Society, vol. 104 (2012), no. 2, pp. 223–252.CrossRefGoogle Scholar
Nemoto, T., Determinacy of Wadge classes and subsystems of second order arithmetic, Mathematical Logic Quarterly, vol. 55 (2009), no. 2, pp. 154–176.CrossRefGoogle Scholar
Nemoto, T. and Sato, K., A marriage of Brouwer’s Intuitionism and Hilbert’s Finitism I: Arithmetic, this JOURNAL, accepted for publication.Google Scholar
Rin, B. G. and Walsh, S., Realizability semantics for quantified modal logic: Generalizing Flagg’s 1985 construction, The Review of Symbolic Logic, vol. 9 (2016), no. 4, pp. 752–809.CrossRefGoogle Scholar
Rosebrock, T., Some models and semi-decidability notions of applicative theories, Ph.D. thesis, in preparation.Google Scholar
Troelstra, A. S. and van Dalen, D., Constructivism in Mathematics, I, Studies in Logic and the Foundations of Mathematics, vol. 121, North-Holland, Amsterdam, 1988.Google Scholar
Troelstra, A. S. and van Dalen, D., Constructivism in Mathematics, II, Studies in Logic and the Foundations of Mathematics, vol. 123, North-Holland, Amsterdam, 1988.Google Scholar