Switch to: References

Citations of:

Hilbert’s Program

In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab (2014)

Add citations

You must login to add citations.
  1. Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.
    A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hilbert's program then and now.Richard Zach - 2006 - In Dale Jacquette (ed.), Philosophy of Logic. North Holland. pp. 411–447.
    Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Signs as a Theme in the Philosophy of Mathematical Practice.David Waszek - 2021 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Springer.
    Why study notations, diagrams, or more broadly the variety of nonverbal “representations” or “signs” that are used in mathematical practice? This chapter maps out recent work on the topic by distinguishing three main philosophical motivations for doing so. First, some work (like that on diagrammatic reasoning) studies signs to recover norms of informal or historical mathematical practices that would get lost if the particular signs that these practices rely on were translated away; work in this vein has the potential to (...)
    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  
  • Dag Prawitz on Proofs and Meaning.Heinrich Wansing (ed.) - 2014 - Cham, Switzerland: Springer.
    This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • How are Concepts of Infinity Acquired?Kazimierz Trzęsicki - 2015 - Studies in Logic, Grammar and Rhetoric 40 (1):179-217.
    Concepts of infinity have been subjects of dispute since antiquity. The main problems of this paper are: is the mind able to acquire a concept of infinity? and: how are concepts of infinity acquired? The aim of this paper is neither to say what the meanings of the word “infinity” are nor what infinity is and whether it exists. However, those questions will be mentioned, but only in necessary extent.
    Download  
     
    Export citation  
     
    Bookmark  
  • How Do You Apply Mathematics?Graham Priest - 2022 - Axiomathes 32 (3):1169-1184.
    As far as disputes in the philosophy of pure mathematics goes, these are usually between classical mathematics, intuitionist mathematics, paraconsistent mathematics, and so on. My own view is that of a mathematical pluralist: all these different kinds of mathematics are equally legitimate. Applied mathematics is a different matter. In this, a piece of pure mathematics is applied in an empirical area, such as physics, biology, or economics. There can then certainly be a disputes about what the correct pure mathematics to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Objectivity in Mathematics, Without Mathematical Objects†.Markus Pantsar - 2021 - Philosophia Mathematica 29 (3):318-352.
    I identify two reasons for believing in the objectivity of mathematical knowledge: apparent objectivity and applications in science. Focusing on arithmetic, I analyze platonism and cognitive nativism in terms of explaining these two reasons. After establishing that both theories run into difficulties, I present an alternative epistemological account that combines the theoretical frameworks of enculturation and cumulative cultural evolution. I show that this account can explain why arithmetical knowledge appears to be objective and has scientific applications. Finally, I will argue (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On Some Properties of Humanly Known and Humanly Knowable Mathematics.Jason L. Megill, Tim Melvin & Alex Beal - 2014 - Axiomathes 24 (1):81-88.
    We argue that the set of humanly known mathematical truths (at any given moment in human history) is finite and so recursive. But if so, then given various fundamental results in mathematical logic and the theory of computation (such as Craig’s in J Symb Log 18(1): 30–32(1953) theorem), the set of humanly known mathematical truths is axiomatizable. Furthermore, given Godel’s (Monash Math Phys 38: 173–198, 1931) First Incompleteness Theorem, then (at any given moment in human history) humanly known mathematics must (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • El enfoque epistemológico de David Hilbert: el a priori del conocimiento y el papel de la lógica en la fundamentación de la ciencia.Rodrigo Lopez-Orellana - 2019 - Principia: An International Journal of Epistemology 23 (2):279-308.
    This paper explores the main philosophical approaches of David Hilbert’s theory of proof. Specifically, it is focuses on his ideas regarding logic, the concept of proof, the axiomatic, the concept of truth, metamathematics, the a priori knowledge and the general nature of scientific knowledge. The aim is to show and characterize his epistemological approach on the foundation of knowledge, where logic appears as a guarantee of that foundation. Hilbert supposes that the propositional apriorism, proposed by him to support mathematics, sustains (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On computable numbers with an application to the AlanTuringproblem.C. F. Huws & J. C. Finnis - 2017 - Artificial Intelligence and Law 25 (2):181-203.
    This paper explores the question of whether or not the law is a computable number in the sense described by Alan Turing in his 1937 paper ‘On computable numbers with an application to the Entscheidungsproblem.’ Drawing upon the legal, social, and political context of Alan Turing’s own involvement with the law following his arrest in 1952 for the criminal offence of gross indecency, the article explores the parameters of computability within the law and analyses the applicability of Turing’s computability thesis (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Unfolding finitist arithmetic.Solomon Feferman & Thomas Strahm - 2010 - Review of Symbolic Logic 3 (4):665-689.
    The concept of the (full) unfolding of a schematic system is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted ? The program to determine for various systems of foundational significance was previously carried out for a system of nonfinitist arithmetic, ; it was shown that is proof-theoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Different Ways in which Logic is (said to be) Formal.Catarina Dutilh Novaes - 2011 - History and Philosophy of Logic 32 (4):303 - 332.
    What does it mean to say that logic is formal? The short answer is: it means (or can mean) several different things. In this paper, I argue that there are (at least) eight main variations of the notion of the formal that are relevant for current discussions in philosophy and logic, and that they are structured in two main clusters, namely the formal as pertaining to forms, and the formal as pertaining to rules. To the first cluster belong the formal (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Grounds for Trust: Essential Epistemic Opacity and Computational Reliabilism.Juan M. Durán & Nico Formanek - 2018 - Minds and Machines 28 (4):645-666.
    Several philosophical issues in connection with computer simulations rely on the assumption that results of simulations are trustworthy. Examples of these include the debate on the experimental role of computer simulations :483–496, 2009; Morrison in Philos Stud 143:33–57, 2009), the nature of computer data Computer simulations and the changing face of scientific experimentation, Cambridge Scholars Publishing, Barcelona, 2013; Humphreys, in: Durán, Arnold Computer simulations and the changing face of scientific experimentation, Cambridge Scholars Publishing, Barcelona, 2013), and the explanatory power of (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • (Probably) Not companions in guilt.Sharon Berry - 2018 - Philosophical Studies 175 (9):2285-2308.
    In this paper, I will attempt to develop and defend a common form of intuitive resistance to the companions in guilt argument. I will argue that one can reasonably believe there are promising solutions to the access problem for mathematical realism that don’t translate to moral realism. In particular, I will suggest that the structuralist project of accounting for mathematical knowledge in terms of some form of logical knowledge offers significant hope of success while no analogous approach offers such hope (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Axiomatic Method and Category Theory.Rodin Andrei - 2013 - Cham: Imprint: Springer.
    This volume explores the many different meanings of the notion of the axiomatic method, offering an insightful historical and philosophical discussion about how these notions changed over the millennia. The author, a well-known philosopher and historian of mathematics, first examines Euclid, who is considered the father of the axiomatic method, before moving onto Hilbert and Lawvere. He then presents a deep textual analysis of each writer and describes how their ideas are different and even how their ideas progressed over time. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Philosophy and the sciences in the work of Gilles Deleuze, 1953-1968.David James Allen - unknown
    This thesis seeks to understand the nature of and relation between science and philosophy articulated in the early work of the French philosopher Gilles Deleuze. It seeks to challenge the view that Deleuze’s metaphysical and metaphilosophical position is in important part an attempt to respond to twentieth century developments in the natural sciences, claiming that this is not a plausible interpretation of Deleuze’s early thought. The central problem identified with such readings is that they provide an insufficient explanation of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Necessity of Thought.Cesare Cozzo - 2015 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Springer. pp. 101-20.
    The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Maddy On The Multiverse.Claudio Ternullo - 2019 - In Deniz Sarikaya, Deborah Kant & Stefania Centrone (eds.), Reflections on the Foundations of Mathematics. Berlin: Springer Verlag. pp. 43-78.
    Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Seventh Quadrennial Fellows Conference of the Center for Philosophy of Science.-Preprint Volume- - unknown
    Download  
     
    Export citation  
     
    Bookmark  
  • Formalizations après la lettre: Studies in Medieval Logic and Semantics.Catarina Dutilh Novaes - 2006 - Dissertation, Leiden University
    This thesis is on the history and philosophy of logic and semantics. Logic can be described as the ‘science of reasoning’, as it deals primarily with correct patterns of reasoning. However, logic as a discipline has undergone dramatic changes in the last two centuries: while for ancient and medieval philosophers it belonged essentially to the realm of language studies, it has currently become a sub-branch of mathematics. This thesis attempts to establish a dialogue between the modern and the medieval traditions (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Gödel on Truth and Proof.Dan Nesher - unknown
    Download  
     
    Export citation  
     
    Bookmark  
  • Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
    Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal system cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations