Switch to: References

Add citations

You must login to add citations.
  1. Are Turing Machines Platonists? Inferentialism and the Computational Theory of Mind.Jon Cogburn & Jason Megil - 2010 - Minds and Machines 20 (3):423-439.
    We first discuss Michael Dummett’s philosophy of mathematics and Robert Brandom’s philosophy of language to demonstrate that inferentialism entails the falsity of Church’s Thesis and, as a consequence, the Computational Theory of Mind. This amounts to an entirely novel critique of mechanism in the philosophy of mind, one we show to have tremendous advantages over the traditional Lucas-Penrose argument.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Epistemic Modality and Hyperintensionality in Mathematics.Timothy Bowen - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics.Francesca Boccuni & Andrea Sereni (eds.) - 2016 - Cham, Switzerland: Springer International Publishing.
    This volume covers a wide range of topics in the most recent debates in the philosophy of mathematics, and is dedicated to how semantic, epistemological, ontological and logical issues interact in the attempt to give a satisfactory picture of mathematical knowledge. The essays collected here explore the semantic and epistemic problems raised by different kinds of mathematical objects, by their characterization in terms of axiomatic theories, and by the objectivity of both pure and applied mathematics. They investigate controversial aspects of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Forms of Luminosity.Hasen Khudairi - 2017
    This dissertation concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • How do We Know that the Godel Sentence of a Consistent Theory Is True?G. Sereny - 2011 - Philosophia Mathematica 19 (1):47-73.
    Some earlier remarks Michael Dummett made on Gödel’s theorem have recently inspired attempts to formulate an alternative to the standard demonstration of the truth of the Gödel sentence. The idea underlying the non-standard approach is to treat the Gödel sentence as an ordinary arithmetical one. But the Gödel sentence is of a very specific nature. Consequently, the non-standard arguments are conceptually mistaken. In this paper, both the faulty arguments themselves and the general reasons underlying their failure are analysed. The analysis (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
    This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  • Logical and Epistemic Modality.Hasen Khudairi - manuscript
    This paper examines the interaction between the philosophy and psychology of concepts and the modal characterization of the deductive concept of logical validity. The concept of logical consequence on which I focus is model-theoretic, where the concept records the property of necessary truth-preservation from the premise of an argument to its conclusion, as well as the condition that, in the class of all possible worlds in which a premise is true, a consequent formula or succedent class of formulas is true, (...)
     
    Export citation  
     
    Bookmark  
  • On the philosophical relevance of Gödel's incompleteness theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
    A survey of more philosophical applications of Gödel's incompleteness results.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations