Switch to: References

Add citations

You must login to add citations.
  1. Gödel’s philosophical program and Husserl’s phenomenology.Xiaoli Liu - 2010 - Synthese 175 (1):33-45.
    Gödel’s philosophical rationalism includes a program for “developing philosophy as an exact science.” Gödel believes that Husserl’s phenomenology is essential for the realization of this program. In this article, by analyzing Gödel’s philosophy of idealism, conceptual realism, and his concept of “abstract intuition,” based on clues from Gödel’s manuscripts, I try to investigate the reasons why Gödel is strongly interested in Husserl’s phenomenology and why his program for an exact philosophy is unfinished. One of the topics that has attracted much (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Gödel’s Cantorianism.Claudio Ternullo - 2015 - In E.-M. Engelen (ed.), Kurt Gödel: Philosopher-Scientist. Presses Universitaires de Provence. pp. 417-446.
    Gödel’s philosophical conceptions bear striking similarities to Cantor’s. Although there is no conclusive evidence that Gödel deliberately used or adhered to Cantor’s views, one can successfully reconstruct and see his “Cantorianism” at work in many parts of his thought. In this paper, I aim to describe the most prominent conceptual intersections between Cantor’s and Gödel’s thought, particularly on such matters as the nature and existence of mathematical entities (sets), concepts, Platonism, the Absolute Infinite, the progress and inexhaustibility of mathematics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Statistics: Its Utility, Its Risks.John Y. Wu - 2014 - Open Journal of Philosophy 4 (4):445-450.
    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   22 citations  
  • Godel on computability.W. Sieg - 2006 - Philosophia Mathematica 14 (2):189-207.
    The identification of an informal concept of ‘effective calculability’ with a rigorous mathematical notion like ‘recursiveness’ or ‘Turing computability’ is still viewed as problematic, and I think rightly so. I analyze three different and conflicting perspectives Gödel articulated in the three decades from 1934 to 1964. The significant shifts in Gödel's position underline the difficulties of the methodological issues surrounding the Church-Turing Thesis.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • John von Neumann’s Discovery of the 2nd Incompleteness Theorem.Giambattista Formica - 2022 - History and Philosophy of Logic 44 (1):66-90.
    Shortly after Kurt Gödel had announced an early version of the 1st incompleteness theorem, John von Neumann wrote a letter to inform him of a remarkable discovery, i.e. that the consistency of a formal system containing arithmetic is unprovable, now known as the 2nd incompleteness theorem. Although today von Neumann’s proof of the theorem is considered lost, recent literature has explored many of the issues surrounding his discovery. Yet, one question still awaits a satisfactory answer: how did von Neumann achieve (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Incompleteness and Computability: An Open Introduction to Gödel's Theorems.Richard Zach - 2019 - Open Logic Project.
    Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Sets, Logic, Computation: An Open Introduction to Metalogic.Richard Zach - 2019 - Open Logic Project.
    An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.
    Download  
     
    Export citation  
     
    Bookmark  
  • Kurt gödel.Juliette Kennedy - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Dao and Process.Frank J. Hoffman - 2002 - Asian Philosophy 12 (3):197 – 212.
    This paper is about different types of silence, and about differing processes of philosophical investigation and sagely illumination. It is argued that the sagely Dao of wu wei leads to silence in the sense of no spoken words, and the philosophical way of proof leads to silence in the sense of no spoken words. So both proof and wu wei both lead to silence in the sense of no spoken words. Accordingly there is a type of silence that results from (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)On gödel's way in: The influence of Rudolf Carnap.Warren Goldfarb - 2005 - Bulletin of Symbolic Logic 11 (2):185-193.
    The philosopher Rudolf Carnap, although not himself an originator of mathematical advances in logic, was much involved in the development of the subject. He was the most important and deepest philosopher of the Vienna Circle of logical positivists, or, to use the label Carnap later preferred, logical empiricists. It was Carnap who gave the most fully developed and sophisticated form to the linguistic doctrine of logical and mathematical truth: the view that the truths of mathematics and logic do not describe (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A Cognitive Approach to Benacerraf's Dilemma.Luke Jerzykiewicz - 2009 - Dissertation, University of Western Ontario
    One of the important challenges in the philosophy of mathematics is to account for the semantics of sentences that express mathematical propositions while simultaneously explaining our access to their contents. This is Benacerraf’s Dilemma. In this dissertation, I argue that cognitive science furnishes new tools by means of which we can make progress on this problem. The foundation of the solution, I argue, must be an ontologically realist, albeit non-platonist, conception of mathematical reality. The semantic portion of the problem can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Concrete Thinking.Kuang-Ming Wu - 2015 - Open Journal of Philosophy 5 (1):73-86.
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)Step by recursive step: Church's analysis of effective calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.
    Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Zermelo and set theory.Akihiro Kanamori - 2004 - Bulletin of Symbolic Logic 10 (4):487-553.
    Ernst Friedrich Ferdinand Zermelo transformed the set theory of Cantor and Dedekind in the first decade of the 20th century by incorporating the Axiom of Choice and providing a simple and workable axiomatization setting out generative set-existence principles. Zermelo thereby tempered the ontological thrust of early set theory, initiated the delineation of what is to be regarded as set-theoretic, drawing out the combinatorial aspects from the logical, and established the basic conceptual framework for the development of modern set theory. Two (...)
    Download  
     
    Export citation  
     
    Bookmark   14 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Gödel’s notre dame course.Miloš Adžić & Kosta Došen - 2016 - Bulletin of Symbolic Logic 22 (4):469-481.
    This is a companion to a paper by the authors entitled “Gödel’s natural deduction,” which presented and made comments about the natural deduction system in Gödel’s unpublished notes for the elementary logic course he gave at the University of Notre Dame in 1939. In that earlier paper, which was itself a companion to a paper that examined the links between some philosophical views ascribed to Gödel and general proof theory, one can find a brief summary of Gödel’s notes for the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Theorem about Computationalism and “Absolute” Truth.Arthur Charlesworth - 2016 - Minds and Machines 26 (3):205-226.
    This article focuses on issues related to improving an argument about minds and machines given by Kurt Gödel in 1951, in a prominent lecture. Roughly, Gödel’s argument supported the conjecture that either the human mind is not algorithmic, or there is a particular arithmetical truth impossible for the human mind to master, or both. A well-known weakness in his argument is crucial reliance on the assumption that, if the deductive capability of the human mind is equivalent to that of a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Semantics and Truth.Jan Woleński - 2019 - Cham, Switzerland: Springer Verlag.
    The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Preface and introduction.A. Chakrabarty - 1994 - In A. Chakrabarti & B. K. Matilal (eds.), Knowing from Words. Kluwer Academic Publishers. pp. 5-9.
    Download  
     
    Export citation  
     
    Bookmark  
  • Gödel and set theory.Akihiro Kanamori - 2007 - Bulletin of Symbolic Logic 13 (2):153-188.
    Kurt Gödel with his work on the constructible universeLestablished the relative consistency of the Axiom of Choice and the Continuum Hypothesis. More broadly, he ensured the ascendancy of first-order logic as the framework and a matter of method for set theory and secured the cumulative hierarchy view of the universe of sets. Gödel thereby transformed set theory and launched it with structured subject matter and specific methods of proof. In later years Gödel worked on a variety of set theoretic constructions (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Hao Wang as philosopher and interpreter of gödel.Charles Parsons - 1998 - Philosophia Mathematica 6 (1):3-24.
    The paper undertakes to characterize Hao Wang's style, convictions, and method as a philosopher, centering on his most important philosophical work From Mathematics to Philosophy, 1974. The descriptive character of Wang's characteristic method is emphasized. Some specific achievements are discussed: his analyses of the concept of set, his discussion, in connection with setting forth Gödel's views, of minds and machines, and his concept of ‘analytic empiricism’ used to criticize Carnap and Quine. Wang's work as interpreter of Gödel's thought and the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)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 (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • The collapse of the Hilbert program: A variation on the gödelian theme.Saul A. Kripke - 2022 - Bulletin of Symbolic Logic 28 (3):413-426.
    The Hilbert program was actually a specific approach for proving consistency, a kind of constructive model theory. Quantifiers were supposed to be replaced by ε-terms. εxA(x) was supposed to denote a witness to ∃xA(x), or something arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system S, each ε-term can be replaced by a numeral, making each line provable and true. This implies that S must not only be consistent, but also 1-consistent. Here we (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • In praise of replacement.Akihiro Kanamori - 2012 - Bulletin of Symbolic Logic 18 (1):46-90.
    This article serves to present a large mathematical perspective and historical basis for the Axiom of Replacement as well as to affirm its importance as a central axiom of modern set theory.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Bernays and set theory.Akihiro Kanamori - 2009 - Bulletin of Symbolic Logic 15 (1):43-69.
    We discuss the work of Paul Bernays in set theory, mainly his axiomatization and his use of classes but also his higher-order reflection principles.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Zermelo and the Skolem paradox.Dirk Van Dalen & Heinz-Dieter Ebbinghaus - 2000 - Bulletin of Symbolic Logic 6 (2):145-161.
    On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz” in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on a world of objects that could only be grasped adequately by (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Obsessive-Compulsive Disorder as a Disturbance of Security Motivation.Henry Szechtman & Erik Woody - 2004 - Psychological Review 111 (1):111-127.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Epistemology Versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf.Peter Dybjer, Sten Lindström, Erik Palmgren & Göran Sundholm (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Kurt Gödel behind the rational mathematics: Stephen Budiansky: Journey to the edge of reason: the life of Kurt Gödel. Oxford: Oxford University Press, 2021, 368 pp, €23.90 HB. [REVIEW]Annika Kanckos - 2022 - Metascience 31 (2):239-242.
    Download  
     
    Export citation  
     
    Bookmark  
  • Gödel on Deduction.Kosta Došen & Miloš Adžić - 2019 - Studia Logica 107 (1):31-51.
    This is an examination, a commentary, of links between some philosophical views ascribed to Gödel and general proof theory. In these views deduction is of central concern not only in predicate logic, but in set theory too, understood from an infinitistic ideal perspective. It is inquired whether this centrality of deduction could also be kept in the intensional logic of concepts whose building Gödel seems to have taken as the main task of logic for the future.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On göde's philosophical assumptions.Jaakko Hintikka - 1998 - Synthese 114 (1):13-23.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Future tasks for Gödel scholars.John W. Dawson & Cheryl A. Dawson - 2005 - Bulletin of Symbolic Logic 11 (2):150-171.
    As initially envisioned, Gödel's Collected Works were to include transcriptions of material from his mathematical workbooks. In the end that material, as well as some other manuscript items from Gödel's Nachlass, had to be left out. This note describes some of the unpublished items in the Nachlass that are likely to attract the notice of scholars and surveys the extent of shorthand transcription efforts undertaken hitherto. Some examples of sources outside Gödel's Nachlass that may be of interest to Gödel scholars (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Gödel’s Natural Deduction.Kosta Došen & Miloš Adžić - 2018 - Studia Logica 106 (2):397-415.
    This is a companion to a paper by the authors entitled “Gödel on deduction”, which examined the links between some philosophical views ascribed to Gödel and general proof theory. When writing that other paper, the authors were not acquainted with a system of natural deduction that Gödel presented with the help of Gentzen’s sequents, which amounts to Jaśkowski’s natural deduction system of 1934, and which may be found in Gödel’s unpublished notes for the elementary logic course he gave in 1939 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Incompleteness, complexity, randomness and beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
    Gödel's Incompleteness Theorems have the same scientific status as Einstein's principle of relativity, Heisenberg's uncertainty principle, and Watson and Crick's double helix model of DNA. Our aim is to discuss some new faces of the incompleteness phenomenon unveiled by an information-theoretic approach to randomness and recent developments in quantum computing.
    Download  
     
    Export citation  
     
    Bookmark  
  • Russell and gödel.Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (4):504-520.
    This paper surveys the interactions between Russell and Gödel, both personal and intellectual. After a description of Russell’s influence on Gödel, it concludes with a discussion of Russell’s reaction to the incompleteness theorems.
    Download  
     
    Export citation  
     
    Bookmark  
  • The Liar Paradox.Kuang-Ming Wu - 2015 - Open Journal of Philosophy 5 (5):253-260.
    Download  
     
    Export citation  
     
    Bookmark  
  • Godel's unpublished papers on foundations of mathematics.W. W. Tatt - 2001 - Philosophia Mathematica 9 (1):87-126.
    Download  
     
    Export citation  
     
    Bookmark   8 citations