Switch to: References

Add citations

You must login to add citations.
  1. Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
    The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Arithmetic Sinn and Effectiveness.Stewart Shapiro - 1984 - Dialectica 38 (1):3-16.
    SummaryAccording to Dummett's understanding of Frege, the sense of a denoting expression is a procedure for determining its denotation. The purpose of this article is to pursue this suggestion and develop a semi‐formal interpretation of Fregean sense for the special case of a first‐order language of arithmetic. In particular, we define the sense of each arithmetic expression to be a hypothetical process to determine the denoted number or truth value. The sense‐process is “hypothetical” in that the senses of some expressions (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Essay Review.M. Detlefsen - 1988 - History and Philosophy of Logic 9 (1):93-105.
    S. SHAPIRO (ed.), Intensional Mathematics (Studies in Logic and the Foundations of Mathematics, vol. 11 3). Amsterdam: North-Holland, 1985. v + 230 pp. $38.50/100Df.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Thinking machines: Some fundamental confusions. [REVIEW]John T. Kearns - 1997 - Minds and Machines 7 (2):269-87.
    This paper explores Church's Thesis and related claims madeby Turing. Church's Thesis concerns computable numerical functions, whileTuring's claims concern both procedures for manipulating uninterpreted marksand machines that generate the results that these procedures would yield. Itis argued that Turing's claims are true, and that they support (the truth of)Church's Thesis. It is further argued that the truth of Turing's and Church'sTheses has no interesting consequences for human cognition or cognitiveabilities. The Theses don't even mean that computers can do as much (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • In defense of epistemic arithmetic.Leon Horsten - 1998 - Synthese 116 (1):1-25.
    This paper presents a defense of Epistemic Arithmetic as used for a formalization of intuitionistic arithmetic and of certain informal mathematical principles. First, objections by Allen Hazen and Craig Smorynski against Epistemic Arithmetic are discussed and found wanting. Second, positive support is given for the research program by showing that Epistemic Arithmetic can give interesting formulations of Church's Thesis.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   15 citations