Switch to: References

Citations of:

Recursive analysis

Mineola, N.Y.: Dover Publications (1961)

Add citations

You must login to add citations.
  1. Hilbert’s Program.Richard Zach - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
    In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Wittgenstein and finitism.Mathieu Marion - 1995 - Synthese 105 (2):141 - 176.
    In this paper, elementary but hitherto overlooked connections are established between Wittgenstein's remarks on mathematics, written during his transitional period, and free-variable finitism. After giving a brief description of theTractatus Logico-Philosophicus on quantifiers and generality, I present in the first section Wittgenstein's rejection of quantification theory and his account of general arithmetical propositions, to use modern jargon, as claims (as opposed to statements). As in Skolem's primitive recursive arithmetic and Goodstein's equational calculus, Wittgenstein represented generality by the use of free (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
    Download  
     
    Export citation  
     
    Bookmark