Switch to: References

Citations of:

Nested Recursion

Journal of Symbolic Logic 28 (1):103-104 (1963)

Add citations

You must login to add citations.
  1. Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Numbers and functions in Hilbert's finitism.Richard Zach - 1998 - Taiwanese Journal for History and Philosophy of Science 10:33-60.
    David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The Limits of Computation.Andrew Powell - 2022 - Axiomathes 32 (6):991-1011.
    This article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on finitism, constructivity and Hilbert's program.Solomon Feferman - 2008 - Dialectica 62 (2):179-203.
    This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem.Gary Ebbs - 2015 - History and Philosophy of Logic 36 (4):346-366.
    The Hilbert–Bernays Theorem establishes that for any satisfiable first-order quantificational schema S, one can write out linguistic expressions that are guaranteed to yield a true sentence of elementary arithmetic when they are substituted for the predicate letters in S. The theorem implies that if L is a consistent, fully interpreted language rich enough to express elementary arithmetic, then a schema S is valid if and only if every sentence of L that can be obtained by substituting predicates of L for (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Exact bounds on epsilon processes.Toshiyasu Arai - 2011 - Archive for Mathematical Logic 50 (3-4):445-458.
    In this paper we show that the lengths of the approximating processes in epsilon substitution method are calculable by ordinal recursions in an optimal way.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reduction of higher type levels by means of an ordinal analysis of finite terms.Jan Terlouw - 1985 - Annals of Pure and Applied Logic 28 (1):73-102.
    Download  
     
    Export citation  
     
    Bookmark   1 citation