Does the quantum state represent reality or our knowledge of reality? In making this distinction precise, we are led to a novel classification of hidden variable models of quantum theory. We show that representatives of each class can be found among existing constructions for two-dimensional Hilbert spaces. Our approach also provides a fruitful new perspective on arguments for the nonlocality and incompleteness of quantum theory. Specifically, we show that for models wherein the quantum state has the status of something (...) real, the failure of locality can be established through an argument considerably more straightforward than Bell’s theorem. The historical significance of this result becomes evident when one recognizes that the same reasoning is present in Einstein’s preferred argument for incompleteness, which dates back to 1935. This fact suggests that Einstein was seeking not just any completion of quantum theory, but one wherein quantum states are solely representative of our knowledge. Our hypothesis is supported by an analysis of Einstein’s attempts to clarify his views on quantum theory and the circumstance of his otherwise puzzling abandonment of an even simpler argument for incompleteness from 1927. (shrink)

This paper introduces the axiom of Negative Dominance, stating that if a lottery f is strictly preferred to a lottery g, then some outcome in the support of f is strictly preferred to some outcome in the support of g. It is shown that if preferences are incomplete on a sufficiently rich domain, then this plausible axiom, which holds for complete preferences, is incompatible with an array of otherwise plausible axioms for choice under uncertainty. In particular, in this setting, Negative (...) Dominance conflicts with the standard Independence axiom. A novel theory, which includes Negative Dominance, and rejects Independence, is developed and shown to be consistent. (shrink)

This Element takes a deep dive into Gödel's 1931 paper giving the first presentation of the Incompleteness Theorems, opening up completely passages in it that might possibly puzzle the student, such as the mysterious footnote 48a. It considers the main ingredients of Gödel's proof: arithmetization, strong representability, and the Fixed Point Theorem in a layered fashion, returning to their various aspects: semantic, syntactic, computational, philosophical and mathematical, as the topic arises. It samples some of the most important proofs of (...) the Incompleteness Theorems, e.g. due to Kuratowski, Smullyan and Robinson, as well as newer proofs, also of other independent statements, due to H. Friedman, Weiermann and Paris-Harrington. It examines the question whether the incompleteness of e.g. Peano Arithmetic gives immediately the undecidability of the Entscheidungsproblem, as Kripke has recently argued. It considers set-theoretical incompleteness, and finally considers some of the philosophical consequences considered in the literature. (shrink)

Gödel’s incompleteness theorems are often treated either as purely technical results with no broader philosophical significance or as evidence for far-reaching metaphysical conclusions. This paper rejects both extremes. I argue that incompleteness is best understood as revealing a structural limitation of formal representation rather than a contingent defect of particular axiomatic systems or an epistemic shortcoming of mathematical practice. After clarifying what Gödel’s theorems do and do not establish, I critically examine formalist, Platonist, and instrumentalist interpretations, showing that (...) none adequately accounts for the systematic persistence of incompleteness across expressive formal frameworks. I propose a conceptually modest notion of ontological excess to characterize the mismatch between formal systems and what they represent, without invoking speculative ontology or empirical claims. On this view, incompleteness reflects limits of formal capture, not limits of truth or knowledge. The result is a restrained account of the philosophical significance of Gödelian incompleteness, with implications for metaphysical explanation and scientific realism that remain firmly within the bounds of logical analysis. (shrink)

I argue that spacetime singularities entail no ontological commitment to material entities. First, I show that Penrose’s singularity theorem is best understood as a theorem of incompleteness – it demonstrates the failure of specific spacetime models within General Relativity (or any theory incorporating the Raychaudhuri equation) under certain general conditions. Although this has been done before, I adopt a novel approach based on differentiating between physical and purely formal assumptions in the axiomatic formulation of general relativity. Next, I compare (...) Penrose’s result with Gödel’s incompleteness theorem, highlighting key similarities and differences. Finally, I draw philosophical conclusions regarding the limits and prospects of our epistemic reconstructions of the physical world. (shrink)

Based on an empirical study of a research team in natural science, the author argues that collaborating scientists do not trust each other completely. Due to the inherent incompleteness of trust, epistemic trust among scientists is not sufficient to manage epistemic dependency in research teams. To mitigate the limitations of epistemic trust, scientists resort to specific strategies of indirect assessment such as dialoguing practices and the probing of explanatory responsiveness. Furthermore, they rely upon impersonal trust and deploy practices of (...) hierarchical authorship. (shrink)

Prawitz proposed certain notions of proof-theoretic validity and conjectured that intuitionistic logic is complete for them [11, 12]. Considering propositional logic, we present a general framework of five abstract conditions which any proof-theoretic semantics should obey. Then we formulate several more specific conditions under which the intuitionistic propositional calculus turns out to be semantically incomplete. Here a crucial role is played by the generalized disjunction principle. Turning to concrete semantics, we show that prominent proposals, including Prawitz’s, satisfy at least one (...) of these conditions, thus rendering IPC semantically incomplete for them. Only for Goldfarb’s [1] proof-theoretic semantics, which deviates from standard approaches, IPC turns out to be complete. Overall, these results show that basic ideas of proof-theoretic semantics for propositional logic are not captured by IPC. (shrink)

Gödel's true-but-unprovable sentence from the first incompleteness theorem is purely logical in nature, i.e. not mathematically natural or interesting. An interesting problem is to find mathematically natural and interesting statements that are similarly unprovable. A lot of research has since been done in this direction, most notably by Harvey Friedman. A lot of examples of concrete incompleteness with real mathematical content have been found to date. This brief contributes to Harvey Friedman's research program on concrete incompleteness for (...) higher-order arithmetic and gives a specific example of concrete mathematical theorems which is expressible in second-order arithmetic but the minimal system in higher-order arithmetic to prove it is fourth-order arithmetic. This book first examines the following foundational question: are all theorems in classic mathematics expressible in second-order arithmetic provable in second-order arithmetic? The author gives a counterexample for this question and isolates this counterexample from the Martin-Harrington Theorem in set theory. It shows that the statement “Harrington's principle implies zero sharp" is not provable in second-order arithmetic. This book further examines what is the minimal system in higher-order arithmetic to prove the theorem “Harrington's principle implies zero sharp" and shows that it is neither provable in second-order arithmetic or third-order arithmetic, but provable in fourth-order arithmetic. The book also examines the large cardinal strength of Harrington's principle and its strengthening over second-order arithmetic and third-order arithmetic. (shrink)

We present an analogue of Gödel’s second incompleteness theorem for systems of second-order arithmetic. Whereas Gödel showed that sufficiently strong theories that are $\Pi ^0_1$ -sound and $\Sigma ^0_1$ -definable do not prove their own $\Pi ^0_1$ -soundness, we prove that sufficiently strong theories that are $\Pi ^1_1$ -sound and $\Sigma ^1_1$ -definable do not prove their own $\Pi ^1_1$ -soundness. Our proof does not involve the construction of a self-referential sentence but rather relies on ordinal analysis.

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.

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness (...) theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists. (shrink)

The determinism-free will debate is perhaps as old as philosophy itself and has been engaged in from a great variety of points of view including those of scientific, theological, and logical character. This chapter focuses on two arguments from logic. First, there is an argument in support of determinism that dates back to Aristotle, if not farther. It rests on acceptance of the Law of Excluded Middle, according to which every proposition is either true or false, no matter whether the (...) proposition is about the past, present or future. In particular, the argument goes, whatever one does or does not do in the future is determined in the present by the truth or falsity of the corresponding proposition. The second argument coming from logic is much more modern and appeals to Gödel's incompleteness theorems to make the case against determinism and in favour of free will, insofar as that applies to the mathematical potentialities of human beings. The claim more precisely is that as a consequence of the incompleteness theorems, those potentialities cannot be exactly circumscribed by the output of any computing machine even allowing unlimited time and space for its work. The chapter concludes with some new considerations that may be in favour of a partial mechanist account of the mathematical mind. (shrink)

The modal fictionalist faces a problem due to the fact that her chosen story seems to be incomplete—certain things are neither fictionally true nor fictionally false. The significance of this problem is not localized to modal fictionalism, however, since many fictionalists will face it too. By examining how the fictionalist should analyze the notion of truth according to her story, and, in particular, the role that conditionals play for the fictionalist, I develop a novel and elegant solution to the (...) class='Hi'>incompleteness problem. (shrink)

The implicit content associated with incomplete definite descriptions is contributed in the form of definite descriptions of situations. A definite description of this kind is contributed by a small structure in the syntax, which is interpreted, in general terms, as ‘the situation that bears R to s’.

ABSTRACT We use Gödel’s incompleteness theorems as a case study for investigating mathematical depth. We examine the philosophical question of what the depth of Gödel’s incompleteness theorems consists in. We focus on the methodological study of the depth of Gödel’s incompleteness theorems, and propose three criteria to account for the depth of the incompleteness theorems: influence, fruitfulness, and unity. Finally, we give some explanations for our account of the depth of Gödel’s incompleteness theorems.

This paper proposes a critical reassessment of Kurt Gödel’s Incompleteness Theorems (1931) through the lens of Unending-Logical Actualism, a philosophical system developed by Alexandre de Castro Prado. While Gödelian logic demonstrates the existence of unprovable statements within finite formal systems, establishing an insurmountable limit for pure reason, Prado’s thesis contends that such incompleteness stems from a static and atemporal conception of logic. By introducing dynamic variables—such as the update operator (⊕), the free-will vector (α), and the notion of (...) the Productive Unknown (?) —it is demonstrated that what Gödel classifies as unprovable actually constitutes a processing latency within an open system. The article stratifies truth into three levels (Evident, Probable, and Possible) and presents the logical formalization that incompleteness is destroyed by the being's power of updating. It concludes that the universe is not a flawed or lacunar system, but an "Unending" structure, where knowledge is a continuous process of converting potency into act. Reality is rescued as an uninterrupted flow where Gödel’s uncertainty is transmuted into the hope of perpetual discovery, founding a new logic that integrates ethics, science, and presence. (shrink)

In a recent paper S. McCall adds another link to a chain of attempts to enlist Gödel’s incompleteness result as an argument for the thesis that human reasoning cannot be construed as being carried out by a computer.1 McCall’s paper is undermined by a technical oversight. My concern however is not with the technical point. The argument from Gödel’s result to the no-computer thesis can be made without following McCall’s route; it is then straighter and more forceful. Yet the (...) argument fails in an interesting and revealing way. And it leaves a remainder: if some computer does in fact simulate all our mathematical reasoning, then, in principle, we cannot fully grasp how it works. Gödel’s result also points out a certain essential limitation of self-reflection. The resulting picture parallels, not accidentally, Davidson’s view of psychology, as a science that in principle must remain “imprecise”, not fully spelt out. What is intended here by “fully grasp”, and how all this is related to self-reflection, will become clear at the end of this comment. (shrink)

Standard attempts to defend Russell's Theory of Descriptions against the problem posed by incomplete descriptions, are discussed and dismissed as inadequate. It is then suggested that one such attempt, one which exploits the notion of a contextually delimited domain of quantification, may be applicable to incomplete quantifier expressions which are typically treated as quantificational: expressions of the form AllF's, NoF's, SomeF's, Exactly eightF's, etc. In this way, one is able to retain the plausible claim that such expressions ought to receive (...) their usual quantificational analyses. The conclusion tentatively drawn is that perhaps definite descriptions arenot amenable to a (Russellian) quantificational analysis. (shrink)

We give a survey of current research on Gödel’s incompleteness theorems from the following three aspects: classifications of different proofs of Gödel’s incompleteness theorems, the limit of the applicability of Gödel’s first incompleteness theorem, and the limit of the applicability of Gödel’s second incompleteness theorem.

In the Handbook of Mathematical Logic, the Paris-Harrington variant of Ramsey's theorem is celebrated as the first result of a long ‘search’ for a purely mathematical incompleteness result in first-order Peano arithmetic. This paper questions the existence of any such search and the status of the Paris-Harrington result as the first mathematical incompleteness result. In fact, I argue that Gentzen gave the first such result, and that it was restated by Goodstein in a number-theoretic form.

The paper argues that the naturalised version of semantic inferentialism advanced by Jaroslav Peregrin faces a problem which, following Michael Devitt, I call the incompleteness problem. The main issue has to do with how, according to inferentialism, language is connected to the world. My main claim is that Peregrin’s Protagorean account of correctness is in tension with the idea, made also by Robert Brandom, that language is embodied in the world analogically to how physical objects are embodied in games (...) like football. Against this, I show the two are in fact importantly disanalogical. To solve the incompleteness problem, I argue that naturalised inferentialism should learn the central lessons of semantic externalism, namely that the connection between language and the world must be fundamentally external to the mind, or in Peregrin’s case, to the society of normative attitudes. (shrink)

A survey of more philosophical applications of Gödel's incompleteness results.

In this paper, we argue that the systems Basic Logic of Evidence (BLE) and Logic of Evidence and Truth (LETJ) suffer a kind of semantic incompleteness with respect to the informal notion of evidence. More especifically, we argue that the connective o of the logic LETJ fails to validate intuitive principles about conclusive evidence.

Classical mechanics is often considered to be a quintessential example of a deterministic theory. I present a simple proof, using a construction mathematically analogous to that of the Pasadena game (Nover and Hájek, 2004), to show that classical mechanics is incomplete: there are uncountably many arrangements of objects in an infinite Newtonian space such that, although the system’s initial condition is fully known, it is impossible to calculate the system’s future trajectory because the total force exerted upon some objects is (...) mathematically undefined. It is then shown how variations of this discrete system can be obtained which increasingly approximate a uniform mass distribution, similar to that underlying a related result, due to von Seeliger (1895). It is then argued that this incompleteness result, as well as that presented by the Pasadena game, has no real philosophical significance as it is a mathematical pseudoproblem shared by all models which attempt to aggregate infinitely many numerical values of a certain kind. (shrink)

A challenge for theories of incomplete descriptions is to capture the consistency of ‘Sobel sequences’ and to account for an asymmetry in the acceptability of utterances of Sobel sequences and ‘reverse Sobel sequences’. David Lewis’s theory of incomplete descriptions answers, unlike many other theories, the challenge from Sobel sequences, but it does not answer the challenge from reverse Sobel sequences. This article presents another asymmetry in the availability of anaphoric readings of Sobel sequences and reverse Sobel sequences, and proposes an (...) explanation of the original asymmetry on its grounds. This provides an answer to the challenge for Lewis’s theory. (shrink)

This is an exploration of a cluster of related logical results. Taken together these seem to have something philosophically important to teach us: something about knowledge and truth and something about the logical impossibility of totalities of knowledge and truth. The book includes explorations of new forms of the ancient and venerable paradox of the :Liar, applications and extensions of Kaplan and Montague's paradox of the Knower, generalizations of Godel's work on incompleteness, and new uses of Cantorian diagonalization. Throughout, (...) the concern is with metaphysical and epistemological implications of these results: what such results may have to teach us about knowledge, truth, and possibility. (shrink)

Graham Priest introduces an informal but presumably rigorous and sharp ‘provability predicate’. He argues that this predicate yields inconsistencies, along the lines of the paradox of the Knower. One long-standing claim of Priest’s is that a dialetheist can have a complete, decidable, and yet sufficiently rich mathematical theory. After all, the incompleteness theorem is, in effect, that for any recursive theory A, if A is consistent, then A is incomplete. If the antecedent fails, as it might for a dialetheist, (...) then the consequent may also fail to hold. One somewhat friendly purpose of my ‘Incompleteness and inconsistency’ was to improve the technical situation for the dialetheist, eschewing reliance on an informal provability predicate. Another, less friendly purpose was to bring out what I took to be some untoward consequences of the situation. It seems that Priest accepted at least some of the improvements that I attempted. In the second edition of In contradiction, he responded to the alleged untoward consequences. One purpose of this note is to revisit the technical and philosophical situation. There were some errors in my original presentation, brought out by discussion with Priest and by Hartry Field’s analysis of the second incompleteness theorem in such contexts. A second task here is to present a sort of Curry version of the Gödel incompleteness situation. I tentatively conclude that even for a dialetheist, an interesting and complete theory is not as easy to come by as it may look—at least not for theories of arithmetic that are plausible for a dialetheist. (shrink)

Berto’s highly readable and lucid guide introduces students and the interested reader to Gödel’s celebrated _Incompleteness Theorem_, and discusses some of the most famous - and infamous - claims arising from Gödel's arguments. Offers a clear understanding of this difficult subject by presenting each of the key steps of the _Theorem_ in separate chapters Discusses interpretations of the _Theorem_ made by celebrated contemporary thinkers Sheds light on the wider extra-mathematical and philosophical implications of Gödel’s theories Written in an accessible, non-technical (...) style. (shrink)

In this paper, we prove the semantic incompleteness of some expansions of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that were proposed in Liberman et al. (2020) “Dynamic Term-modal Logics for First-order Epistemic Planning.” Term-modal logic is a family of first-order modal logics having term-modal operators indexed with terms in the first-order language. While some first-order formula is valid over the corresponding class of frames in the involved Kripke semantics, it is not (...) provable in those expansions. We show this fact by introducing a non-standard Kripke semantics which makes the meanings of constants and function symbols relative to the meanings of relation symbols combined with them. We also address an incorrect frame correspondence result given in Liberman et al. (2020). (shrink)

How do we prove true but unprovable propositions? Gödel produced a statement whose undecidability derives from its ad hoc construction. Concrete or mathematical incompleteness results are interesting unprovable statements of formal arithmetic. We point out where exactly the unprovability lies in the ordinary ‘mathematical’ proofs of two interesting formally unprovable propositions, the Kruskal-Friedman theorem on trees and Girard's normalization theorem in type theory. Their validity is based on robust cognitive performances, which ground mathematics in our relation to space and (...) time, such as symmetries and order, or on the generality of Herbrand's notion of ‘prototype proof’. (shrink)

One can neither inquire into what one knows nor into what one doesn’t know. The first leg of this problem has recently been called the Dogmatism Puzzle. If knowledge is incompatible with inquiry, the thought goes, knowledge breeds dogmatism. Call the second leg of the problem the Ignorance Puzzle. Inquiry starts from not knowing what one seeks to know, and yet it cannot simply start from ignorance. A compelling solution, we argue, jointly addresses the Dogmatism and Ignorance Puzzles. Inquirers, we (...) propose, are in Incomplete Ignorance. They have proleptic concepts, which enable them to ask questions. We defend a minimalist account of the complement of questions. Questions, this chapter argues, call for an improvement of the inquirer’s cognitive state regarding the issue. Such improvement may psychologically close off further inquiry. But the inquirer’s cognitive state is not thereby epistemically closed. In principle, it permits further inquiry. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set (...) theory. Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

This book concentrates on research done during the last twenty years on the philosophy of quantum mechanics. In particular, the author focuses on three major issues: whether quantum mechanics is an incomplete theory, whether it is non-local, and whether it can be interpreted realistically. Much of the book is concerned with distinguishing various senses in which these questions can be taken, and assessing the bewildering variety of answers philosophers and physicists have given up to now. The book is self-contained in (...) that it presents the necessary parts of the mathematical formalism of quantum mechanics and also covers other interpretative topics, such as the problem of measurement and the uncertainty relations. A considerable portion of the book is based on original arguments presented by the author in lectures and research papers over the past ten years. However, this material is integrated with a broad coverage of most of the recent research in the field, so as to provide a balanced introduction to the whole subject. (shrink)

The main point of this paper has been to show that the concept of evaluative incompleteness deserves consideration. In addition, I have suggested that it is plausible to accept that certain states of affairs in fact are evaluatively incomplete. But I have not sought to prove that this is so; indeed, I do not know how such proof might be given. Just which states of affairs, if any, are evaluatively incomplete is an extremely vexed question, and it is not (...) one to which I have attempted to supply any systematic answer. My aim has been merely to point out that it is arguable that certain states of affairs are evaluatively incomplete — a fact that ought not to be overlooked due to an unquestioning acceptance of (II) and a fact which, certainly, ought not to be ruled out by fiat due to an adherence to definitions and assumptions which imply that (II) is false. (shrink)

Defense of incompletable grounding and discussion of implications for ontological economy.

We argue that Wittgenstein’s philosophical perspective on Gödel’s most famous theorem is even more radical than has commonly been assumed. Wittgenstein shows in detail that there is no way that the Gödelian construct of a string of signs could be assigned a useful function within (ordinary) mathematics. — The focus is on Appendix III to Part I of Remarks on the Foundations of Mathematics. The present reading highlights the exceptional importance of this particular set of remarks and, more specifically, emphasises (...) its refined composition and rigorous internal structure. (shrink)

Dialetheism is the view that there exists a true contradiction. This paper ventures to suggest that Priest’s argument for Dialetheism from Gödel’s theorem is unconvincing as the lesson of Gödel’s proof (or Rosser’s proof) is that any sufficiently strong theories of arithmetic cannot be both complete and consistent. In addition, a contradiction is derivable in Priest’s inconsistent and complete arithmetic. An alternative argument for Dialetheism is given by applying Gödel sentence to the inconsistent and complete theory of arithmetic. We argue, (...) however, that the alternative argument raises a circularity problem. In sum, Gödel’s and its related theorem merely show the relation between a complete and a consistent theory. A contradiction derived by the application of Gödel sentence has the value of true sentences, i.e. the both-value, only under the inconsistent models for arithmetic. Without having the assumption of inconsistency or completeness, a true contradiction is not derivable from the application of Gödel sentence. Hence, Gödel’s and its related theorem never can be a ground for Dialetheism. (shrink)

This article presents a new argument against many forms of moral and prudential value incompleteness. The argument relies on two central principles: (i) a weak "negative dominance" principle, to the effect that Lottery 1 is better than Lottery 2 only if some possible outcome of Lottery 1 is better than some possible outcome of Lottery 2, and (ii) a weak form of ex ante Pareto, to the effect that, if Lottery 1 gives an unambiguously better (stochastically dominant) prospect to (...) some individuals than Lottery 2, and equally good prospects to everyone else, then Lottery 1 is better than Lottery 2. Given modest auxiliary assumptions, these two principles rule out incompleteness in the prudential ranking of individual lives, and many forms of incompleteness in the moral rankings of outcomes and lotteries. (shrink)

Gödelʼs incompleteness theorems, published in 1931, are important and profound results in the foundations and philosophy of mathematics. On the basis of new advances in research on incompleteness in the literature, we discuss the correct interpretations of Gödelʼs incompleteness theorems, their inffuence on various ffelds, and the limit of their applicability. The motivation of this paper is threefold: to explore the foundational and philosophical signiffcance of new advances in research on incompleteness since Gödel, to introduce new (...) advances in research on incompleteness to the general philosophy community, and to commemorate the 90th anniversary of the publication of Gödelʼs incompleteness theorems. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the (...) Meyer-Mortensen collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

In the presence of incomplete risk attitudes, choices between noncomparable risky prospects are random. A random choice model advanced by Karni, 2021) includes the hypothesis that choices among noncomparable risky prospects are prompted by signals drawn from personal distributions. This paper introduces a scheme designed to elicit subjects’ assessments of their personal likelihoods of choices among noncomparable risky prospects and describes experiments designed to test the aforementioned hypothesis.

We give a proof of Gödel's first incompleteness theorem based on Berry's paradox, and from it we also derive the second incompleteness theorem model-theoretically.

We begin by considering two principles, each having the form causal completeness ergo screening-off. The first concerns a common cause of two or more effects; the second describes an intermediate link in a causal chain. They are logically independent of each other, each is independent of Reichenbach's principle of the common cause, and each is a consequence of the causal Markov condition. Simple examples show that causal incompleteness means that screening-off may fail to obtain. We derive a stronger result: (...) in a rather general setting, if the composite cause C1 & C2 & … & Cn screens-off one event from another, then each of the n component causes C1, C2, …, Cn must fail to screen-off. The idea that a cause may be ordinally invariant in its impact on different effects is defined; it plays an important role in establishing this no-go theorem. Along the way, we describe how composite and component causes can all screen-off when ordinal invariance fails. We argue that this theorem is relevant to assessing the plausibility of the two screening-off principles. The discovery of incomplete causes that screen-off is not evidence that causal completeness must engender screening-off. Formal and epistemic analogies between screening-off and determinism are discussed. (shrink)

In addition to this being the centenary of Kurt Gödel’s birth, January marked 75 years since the publication (1931) of his stunning incompleteness theorems. Though widely known in one form or another by practicing mathematicians, and generally thought to say something fundamental about the limits and potentialities of mathematical knowledge, the actual importance of these results for mathematics is little understood. Nor is this an isolated example among famous results. For example, not long ago, Philip Davis wrote me about (...) what he calls The Paradox of Irrelevance: “There are many math problems that have achieved the cachet of tremendous significance, e.g. Fermat, 4 color, Kepler’s packing, Gödel, etc. Of Fermat, I have read: ‘the most famous math problem of all time.’ Of Gödel, I have read: ‘the most mathematically significant achievement of the 20th century.’ … Yet, these problems have engaged the attention of relatively few research mathematicians—even in pure math.” What accounts for this disconnect between fame and relevance? Before going into the question for Gödel’s theorems, it should be distinguished in one respect from the other examples mentioned, which in any case form quite a mixed bag. Namely, each of the Fermat, 4 color, and Kepler’s packing problems posed a stand-out challenge following extended efforts to settle them; meeting the challenge in each case required new ideas or approaches and intense work, obviously of different degrees. By contrast, Gödel’s theorems were simply unexpected, and their proofs, though requiring novel techniques, were not difficult on the scale of things. Setting that aside, my view of Gödel’s incompleteness theorems is that their relevance to mathematical logic (and its offspring in the theory of computation) is paramount; further, their philosophical relevance is significant, but in just what way is far from settled; and finally, their mathematical relevance outside of logic is very much unsubstantiated but is the object of ongoing, tantalizing efforts.. (shrink)

The purpose of this essay is to publicize, and to a more limited extent, further develop, an alternate proof of Gödel’s incompleteness theorem due to Saul Kripke, based on a notion called fulfillability. Kripke’s work has been publicized in talks, but at the time of writing this essay the only published discussion of the material appears in Putnam (2000). Here, a more detailed and more accessible overview of the approach is given, centered on a novel generalization - the Instability (...) Theorem. After setting up the technical machinery and demonstrating the Instability Theorem, we prove both the first incompleteness theorem and Lob’s theorem. We conclude with some observations regarding potential directions for future research along these lines. (shrink)

Incomplete penetrance and variable expressivity are non‐Mendelian phenomena resulting in the lack of correlation between genotype and phenotype. Not withstanding the diversity in mechanisms, differential expression of homologous alleles within cells manifests as variations in penetrance and expressivity of mutations between individuals of the same genotype. These phenomena are seen most often in dominantly inherited diseases, implying that they are sensitive to concentration of the gene product. In this framework and the advances in understanding the role of microRNA (miRNA) in (...) fine‐tuning gene expression at translational level, we propose miRNA‐mediated regulation as a mechanism for incomplete penetrance and variable expressivity. The presence of miRNA binding sites at 3′ UTR, co‐expression of target gene–miRNA pairs for genes showing incomplete penetrance and variable expressivity derived from available data lend support to our hypothesis. Single nucleotide polymorphisms in the miRNA target site facilitate the implied differential targeting of the transcripts from homologous alleles. (shrink)