Switch to: Citations

Add references

You must login to add references.
  1. On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
    Download  
     
    Export citation  
     
    Bookmark   722 citations  
  • (1 other version)Minds, Machines and Gödel.John R. Lucas - 1961 - Philosophy 36 (137):112-127.
    Gödei's Theorem seems to me to prove that Mechanism is false, that is, that minds cannot be explained as machines. So also has it seemed to many other people: almost every mathematical logician I have put the matter to has confessed to similar thoughts, but has felt reluctant to commit himself definitely until he could see the whole argument set out, with all objections fully stated and properly met. This I attempt to do.
    Download  
     
    Export citation  
     
    Bookmark   195 citations  
  • (1 other version)Minds, Machines and Gödel.J. R. Lucas - 1961 - Etica E Politica 5 (1):1.
    In this article, Lucas maintains the falseness of Mechanism - the attempt to explain minds as machines - by means of Incompleteness Theorem of Gödel. Gödel’s theorem shows that in any system consistent and adequate for simple arithmetic there are formulae which cannot be proved in the system but that human minds can recognize as true; Lucas points out in his turn that Gödel’s theorem applies to machines because a machine is the concrete instantiation of a formal system: therefore, for (...)
    Download  
     
    Export citation  
     
    Bookmark   165 citations  
  • From Mathematics to Philosophy.Hao Wang - 1974 - London and Boston: Routledge.
    First published in 1974. Despite the tendency of contemporary analytic philosophy to put logic and mathematics at a central position, the author argues it failed to appreciate or account for their rich content. Through discussions of such mathematical concepts as number, the continuum, set, proof and mechanical procedure, the author provides an introduction to the philosophy of mathematics and an internal criticism of the then current academic philosophy. The material presented is also an illustration of a new, more general method (...)
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • From Mathematics to Philosophy.Hao Wang - 1975 - British Journal for the Philosophy of Science 26 (2):170-174.
    Download  
     
    Export citation  
     
    Bookmark   82 citations  
  • Mechanical procedures and mathematical experience.Wilfried Sieg - 1994 - In Alexander George (ed.), Mathematics and mind. New York: Oxford University Press. pp. 71--117.
    Wilfred Sieg. Mechanical Procedures and Mathematical Experience.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Church's thesis and cognitive science.R. J. Nelson - 1987 - Notre Dame Journal of Formal Logic 28 (4):581-614.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Mathematical Intuition: Phenomenology and Mathematical Knowledge.Richard Tieszen - 1989 - Dordrecht/Boston/London: Kluwer Academic Publishers.
    "Intuition" has perhaps been the least understood and the most abused term in philosophy. It is often the term used when one has no plausible explanation for the source of a given belief or opinion. According to some sceptics, it is understood only in terms of what it is not, and it is not any of the better understood means for acquiring knowledge. In mathematics the term has also unfortunately been used in this way. Thus, intuition is sometimes portrayed as (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • From Mathematics to Philosophy.Alan Treherne - 1975 - Philosophical Quarterly 25 (99):176-178.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Mechanism, Mentalism, and Metamathematics.Christopher S. Hill & Judson C. Webb - 1983 - Philosophical Review 92 (2):276.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Relative consistency and accessible domains.Wilfried Sieg - 1990 - Synthese 84 (2):259 - 297.
    Wilfred Sieg. Relative Consistency and Accesible Domains.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Kurt Godel and phenomenology.Richard Tieszen - 1992 - Philosophy of Science 59 (2):176-194.
    Godel began to seriously study Husserl's phenomenology in 1959, and the Godel Nachlass is known to contain many notes on Husserl. In this paper I describe what is presently known about Godel's interest in phenomenology. Among other things, it appears that the 1963 supplement to "What is Cantor's Continuum Hypothesis?", which contains Godel's famous views on mathematical intuition, may have been influenced by Husserl. I then show how Godel's views on mathematical intuition and objectivity can be readily interpreted in a (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Metamathematics and the philosophy of mind.Judson Webb - 1968 - Philosophy of Science 35 (June):156-78.
    The metamathematical theorems of Gödel and Church are frequently applied to the philosophy of mind, typically as rational evidence against mechanism. Using methods of Post and Smullyan, these results are presented as purely mathematical theorems and various such applications are discussed critically. In particular, J. Lucas's use of Gödel's theorem to distinguish between conscious and unconscious beings is refuted, while more generally, attempts to extract philosophy from metamathematics are shown to involve only dramatizations of the constructivity problem in foundations. More (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Church's Thesis and Principles for Mechanisms.Robin Gandy - 1980 - In The Kleene Symposium. North-Holland. pp. 123--148.
    Download  
     
    Export citation  
     
    Bookmark   74 citations  
  • Mechanism, Mentalism and Metamathematics. [REVIEW]B. J. - 1981 - Review of Metaphysics 35 (1):176-178.
    In a strictly deterministic universe a Laplacian superman undertakes to predict if a certain ongoing Turing machine will ever halt. Well, he may predict that the machine will be struck by lightning tomorrow but Judson Webb invites us to "idealize" the case sufficiently so that it is not any lack of physical knowledge that stymies the Laplacian superman but rather the negative result of Turing's metamathematical or formal "indeterminacy" that suggests to Webb a the-Turing machines are thus seen to enjoy (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation