Switch to: References

Citations of:

Kurt Gödel, Collected Works

Oxford University Press (1995)

Add citations

You must login to add citations.
  1. Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.
    Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • El escepticismo williamsoniano sobre la utilidad epistémica de la distinción a priori/a posteriori.Emilio Méndez Pinto - 2023 - Dissertation, National Autonomous University of Mexico
    Jurado: Mario Gómez-Torrente (presidente), Miguel Ángel Fernández Vargas (vocal), Santiago Echeverri Saldarriaga (secretario). [Graduado con Mención Honorífica.].
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Meaning and Metaphysical Necessity.Tristan Grotvedt Haze - 2022 - New York: Routledge.
    This book is about the idea that some true statements would have been true no matter how the world had turned out, while others could have been false. It develops and defends a version of the idea that we tell the difference between these two types of truths in part by reflecting on the meanings of words. It has often been thought that modal issues—issues about possibility and necessity—are related to issues about meaning. In this book, the author defends the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Monads and Mathematics: Gödel and Husserl.Richard Tieszen - 2012 - Axiomathes 22 (1):31-52.
    In 1928 Edmund Husserl wrote that “The ideal of the future is essentially that of phenomenologically based (“philosophical”) sciences, in unitary relation to an absolute theory of monads” (“Phenomenology”, Encyclopedia Britannica draft) There are references to phenomenological monadology in various writings of Husserl. Kurt Gödel began to study Husserl’s work in 1959. On the basis of his later discussions with Gödel, Hao Wang tells us that “Gödel’s own main aim in philosophy was to develop metaphysics—specifically, something like the monadology of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Gödel And The Intuition Of Concepts.Richard Tieszen - 2002 - Synthese 133 (3):363-391.
    Gödel has argued that we can cultivate the intuition or ‘perception’ of abstractconcepts in mathematics and logic. Gödel's ideas about the intuition of conceptsare not incidental to his later philosophical thinking but are related to many otherthemes in his work, and especially to his reflections on the incompleteness theorems.I describe how some of Gödel's claims about the intuition of abstract concepts are related to other themes in his philosophy of mathematics. In most of this paper, however,I focus on a central (...)
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Arithmetic, Mathematical Intuition, and Evidence.Richard Tieszen - 2015 - Inquiry: An Interdisciplinary Journal of Philosophy 58 (1):28-56.
    This paper provides examples in arithmetic of the account of rational intuition and evidence developed in my book After Gödel: Platonism and Rationalism in Mathematics and Logic . The paper supplements the book but can be read independently of it. It starts with some simple examples of problem-solving in arithmetic practice and proceeds to general phenomenological conditions that make such problem-solving possible. In proceeding from elementary ‘authentic’ parts of arithmetic to axiomatic formal arithmetic, the paper exhibits some elements of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets.Martin K. Solomon - 1993 - Mathematical Logic Quarterly 39 (1):384-392.
    We provide and interpret a new measure independent characterization of the Gödel speed-up phenomenon. In particular, we prove a theorem that demonstrates the indifference of the concept of a measure independent Gödel speed-up to an apparent weakening of its definition that is obtained by requiring only those measures appearing in some fixed Blum complexity measure to participate in the speed-up, and by deleting the “for all r” condition from the definition so as to relax the required amount of speed-up. We (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • A Connection Between Blum Speedable Sets and Gödel's Speed-Up Theorem.Martin K. Solomon - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (5):417-421.
  • A 4-valued framework encompassing intuitionistic and classical logic.Tin Perkov - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):138-143.
    A 4-valued framework is proposed to distinguish intuitionistically valid formulas within classical validities.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Extensions of the Finitist Point of View.Matthias Schirn & Karl-Georg Niebergall - 2001 - History and Philosophy of Logic 22 (3):135-161.
    Hilbert developed his famous finitist point of view in several essays in the 1920s. In this paper, we discuss various extensions of it, with particular emphasis on those suggested by Hilbert and Bernays in Grundlagen der Mathematik (vol. I 1934, vol. II 1939). The paper is in three sections. The first deals with Hilbert's introduction of a restricted ? -rule in his 1931 paper ?Die Grundlegung der elementaren Zahlenlehre?. The main question we discuss here is whether the finitist (meta-)mathematician would (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Completeness: from Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
    This paper focuses on the evolution of the notion of completeness in contemporary logic. We discuss the differences between the notions of completeness of a theory, the completeness of a calculus, and the completeness of a logic in the light of Gödel's and Tarski's crucial contributions.We place special emphasis on understanding the differences in how these concepts were used then and now, as well as on the role they play in logic. Nevertheless, we can still observe a certain ambiguity in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Strange Remark Attributed to Gödel.Lloyd Humberstone - 2003 - History and Philosophy of Logic 24 (1):39-44.
    We assemble material from the literature on matrix methodology for sentential logic—without claiming to present any new logical results—in order to show that Gödel once made (or at least, is quoted as having made) an uncharacteristically ill-considered remark in this area.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Why is Cantor’s Absolute Inherently Inaccessible?Stathis Livadas - 2020 - Axiomathes 30 (5):549-576.
    In this article, as implied by the title, I intend to argue for the unattainability of Cantor’s Absolute at least in terms of the proof-theoretical means of set-theory and of the theory of large cardinals. For this reason a significant part of the article is a critical review of the progress of set-theory and of mathematical foundations toward resolving problems which to the one or the other degree are associated with the concept of infinity especially the one beyond that of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Extending the Non-extendible: Shades of Infinity in Large Cardinals and Forcing Theories.Stathis Livadas - 2018 - Axiomathes 28 (5):565-586.
    This is an article whose intended scope is to deal with the question of infinity in formal mathematics, mainly in the context of the theory of large cardinals as it has developed over time since Cantor’s introduction of the theory of transfinite numbers in the late nineteenth century. A special focus has been given to this theory’s interrelation with the forcing theory, introduced by P. Cohen in his lectures of 1963 and further extended and deepened since then, which leads to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • The Role of Intuition in Gödel’s and Robinson’s Points of View.Talia Leven - 2019 - Axiomathes 29 (5):441-461.
    Before Abraham Robinson and Kurt Gödel became familiar with Paul Cohen’s Results, both logicians held a naïve Platonic approach to philosophy. In this paper I demonstrate how Cohen’s results influenced both of them. Robinson declared himself a Formalist, while Gödel basically continued to hold onto the old Platonic approach. Why were the reactions of Gödel and Robinson to Cohen’s results so drastically different in spite of the fact that their initial philosophical positions were remarkably similar? I claim that the key (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Quantifying weak emergence.Paul Hovda - 2008 - Minds and Machines 18 (4):461-473.
    The concept of weak emergence is a refinement or specification of the intuitive, general notion of emergence. Basically, a fact about a system is said to be weakly emergent if its holding both (i) is derivable from the fundamental laws of the system together with some set of basic (non-emergent) facts about it, and yet (ii) is only derivable in a particular manner, called “simulation.” This essay analyzes the application of this notion Conway’s Game of Life, and concludes that a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Zermelo: Boundary numbers and domains of sets continued.Heinz-Dieter Ebbinghaus - 2006 - History and Philosophy of Logic 27 (4):285-306.
    Towards the end of his 1930 paper on boundary numbers and domains of sets Zermelo briefly discusses the questions of consistency and of the existence of an unbounded sequence of strongly inaccessible cardinals, deferring a detailed discussion to a later paper which never appeared. In a report to the Emergency Community of German Science from December 1930 about investigations in progress he mentions that some of the intended extensions of these topics had been worked out and were nearly ready for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Cut as Consequence.Curtis Franks - 2010 - History and Philosophy of Logic 31 (4):349-379.
    The papers where Gerhard Gentzen introduced natural deduction and sequent calculi suggest that his conception of logic differs substantially from the now dominant views introduced by Hilbert, Gödel, Tarski, and others. Specifically, (1) the definitive features of natural deduction calculi allowed Gentzen to assert that his classical system nk is complete based purely on the sort of evidence that Hilbert called ?experimental?, and (2) the structure of the sequent calculi li and lk allowed Gentzen to conceptualize completeness as a question (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Prose versus proof: Wittgenstein on gödel, Tarski and Truth.Juliet Floyd - 2001 - Philosophia Mathematica 9 (3):280-307.
    A survey of current evidence available concerning Wittgenstein's attitude toward, and knowledge of, Gödel's first incompleteness theorem, including his discussions with Turing, Watson and others in 1937–1939, and later testimony of Goodstein and Kreisel; 2) Discussion of the philosophical and historical importance of Wittgenstein's attitude toward Gödel's and other theorems in mathematical logic, contrasting this attitude with that of, e.g., Penrose; 3) Replies to an instructive criticism of my 1995 paper by Mark Steiner which assesses the importance of Tarski's semantical (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  • The gödel editorial project: A synopsis.Solomon Feferman - 2005 - Bulletin of Symbolic Logic 11 (2):132-149.
    The final two volumes, numbers IV and V, of the Oxford University Press edition of the Collected Works of Kurt Gödel [3]-[7] appeared in 2003, thus completing a project that started over twenty years earlier. What I mainly want to do here is trace, from the vantage point of my personal involvement, the at some times halting and at other times intense development of the Gödel editorial project from the first initiatives following Gödel’s death in 1978 to its completion last (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Strict finitism, feasibility, and the sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Arithmetical Reflection and the Provability of Soundness.Walter Dean - 2015 - Philosophia Mathematica 23 (1):31-64.
    Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  • Against Cumulative Type Theory.Tim Button & Robert Trueman - 2022 - Review of Symbolic Logic 15 (4):907-49.
    Standard Type Theory, STT, tells us that b^n(a^m) is well-formed iff n=m+1. However, Linnebo and Rayo have advocated the use of Cumulative Type Theory, CTT, has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α. In this paper, we set ourselves against CTT. We begin our case by arguing against Linnebo and Rayo’s claim that CTT sheds new philosophical light on set theory. We then argue that, while CTT ’s type-restrictions are unjustifiable, the type-restrictions imposed by (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations