INCOMPLETENESS VIA PARADOX AND COMPLETENESS

The proof-theoretic results on axiomatic theories oftruth obtained by different authors in recent years are surveyed.In particular, the theories of truth are related to subsystems ofsecond-order analysis. On the basis of these results, thesuitability of axiomatic theories of truth for ontologicalreduction is evaluated.

In this paper we will investigate different axiomatic theories of truth that are minimal in some sense. One criterion for minimality will be conservativity over Peano Arithmetic. We will then give a more fine-grained characterization by investigating some interpretability relations. We will show that disquotational theories of truth, as well as compositional theories of truth with restricted induction are relatively interpretable in Peano Arithmetic. Furthermore, we will give an example of a theory of truth that is a conservative extension of Peano Arithmetic but not interpretable in it. We will then use stricter versions of interpretations to compare weak theories of truth to subsystems of second-order arithmetic.

The concept of truth occupies a curious place in logic. On the one hand it is central; showing completeness and correctness for a given deductive system is a matter of showing that what is true lines up with what is provable. On the other hand truth is almost always a meta-theoretical notion, which is not present within the deductive systems considered. Ever since the work of Tarski, we know that straightforwardly internalizing the concept of truth is impossible, due to the Liar paradox. Axiomatic theories of truth are an attempt at circumventing this paradox, by introducing a primitive truth predicate, and suitable axioms governing it.The chief aim of this thesis is to give a self-contained introduction to truth deflationism, the philosophical position that the concept of truth has only a minor linguistic role to fulfill, and the axiomatic truth theories that underlie it. In particular, an account of the conservativity debate is given, as exemplified by the axiomatic truth theories TB and CT. Critics of truth deflationism have pointed out that an axiomatic truth theory can’t be both conservative, roughly meaning that it does not provide genuinely new mathematical knowledge (like TB), and validate truth-theoretical reasoning (like CT).Recently, a reply for the deflationist has been proposed that rests on an implicit com- mitment to certain reflection principles, which (partially) express the soundness of a deductive system. If one is committed to a reflection principle for a conservative truth theory, like TB, then one can obtain stronger systems like CT. The different technical results are presented, and the philosophical motivation for this implicit commitment is evaluated. It is argued that reflection principles are indeed acceptable, and crucially, can be justified without recourse to the strong concept of truth which they are supposed to recover for the truth deflationist. This leaves the truth deflationist in a position to withstand the criticism: the concept of truth can be conservative, in an appropriate sense, and linguistically useful too.

The logician Kurt Gödel (1906–1978) published a paper in 1931 formulating what have come to be known as his 'incompleteness theorems', which prove, among other things, that within any formal system with resources sufficient to code arithmetic, questions exist which are neither provable nor disprovable on the basis of the axioms which define the system. These are among the most celebrated results in logic today. In this volume, leading philosophers and mathematicians assess important aspects of Gödel's work on the foundations and philosophy of mathematics. Their essays explore almost every aspect of Godel's intellectual legacy including his concepts of intuition and analyticity, the Completeness Theorem, the set-theoretic multiverse, and the state of mathematical logic today. This groundbreaking volume will be invaluable to students, historians, logicians and philosophers of mathematics who wish to understand the current thinking on these issues.

A generalization of the Second Incompleteness Theorem and some exceptions to it

We first state a few previously obtained results that lead to general undecidability and incompleteness theorems in axiomatized theories that range from the theory of finite sets to classical elementary analysis. Out of those results we prove several incompleteness theorems for axiomatic versions of the theory of noncooperative games with Nash equilibria; in particular, we show the existence of finite games whose equilibria cannot be proven to be computable.

By formalizing Berry's paradox, Vopěnka, Chaitin, Boolos and others proved the incompleteness theorems without using the diagonal argument. In this paper, we shall examine these proofs closely and show their relationships. Firstly, we shall show that we can use the diagonal argument for proofs of the incompleteness theorems based on Berry's paradox. Then, we shall show that an extension of Boolos' proof can be considered as a special case of Chaitin's proof by defining a suitable Kolmogorov complexity. We shall show also that Vopěnka's proof can be reformulated in arithmetic by using the arithmetized completeness theorem.

Journal Article A Yabloesque paradox in set theory Get access Laurence Goldstein Laurence Goldstein Hong Kong UniversityPokfulam Road, Hong Konglaurence@hkucc.hku.hk Search for other works by this author on: Oxford Academic Google Scholar Analysis, Volume 54, Issue 4, October 1994, Pages 223–227, https://doi.org/10.1093/analys/54.4.223 Published: 01 October 1994

This article continues our study of axiom systems that can verify their own consistency and prove all Peano Arithmetic's ?1 theorems. We will develop some new types of exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.

This chapter starts with a discussion of the algorithmic concepts of decidability, computability, and enumerability, introduces register machines and their programs as an exact model, and presents the proof of several undecidability results: of the valid first-order sentences, of the first-order sentences valid in finite structures (Trakhtenbrot's Theorem), and of first-order arithmetic. Furthermore, Gödel's incompleteness theorems are treated. Finally, the decidability of two theories is proved, of Presburger arithmetic and of the weak monadic theory of successor. For the latter some facts on finite automata are developed as far as needed.

In spite of the many efforts made to clarify von Neumann's methodology of science, one crucial point seems to have been disregarded in recent literature: his closeness to Hilbert's spirit. In this paper I shall claim that the scientific methodology adopted by von Neumann in his later foundational reflections originates in the attempt to revaluate Hilbert's axiomatics in the light of Gödel's incompleteness theorems. Indeed, axiomatics continues to be pursued by the Hungarian mathematician in the spirit of Hilbert's school. I shall argue this point by examining four basic ideas embraced by von Neumann in his foundational considerations: a) the conservative attitude to assume in mathematics; b) the role that mathematics and the axiomatic approach have to play in all that is science; c) the notion of success as an alternative methodological criterion to follow in scientific research; d) the empirical and, at the same time, abstract nature of mathematical thought. Once these four basic ideas have been accepted, Hilbert's spirit in von Neumann's methodology of science will become clear.

One of the highlights of modern logic is Godel’s incompleteness theorem. It tells us that, e.g. formal arithmetic is incomplete, i.e. there is a statement φ such that neither φ nor ¬φ. can be proved. It put an end to Hilbert’s optimistic claim that (at least) Peano’s axiom system would prove all its true statements. The proof of Godel’s theorem makes extensive use of the theory of computable (or recursive) functions. There is a self-contained elegant presentation of the required parts of recursion theory. The basic trick is the arithmetization of formal theories, in particular arithmetic that can treat (coded versions of) statements inside its theory. The arithmetization is carried out for Gentzen’s natural deduction.

Abstract: This is a modification as well as a model theoretic application of my previous paper Sd- Topology over the theory of a Model. The main intention of this article is to proof and visualize the celebrated Gödel’s completeness and incompleteness theorems in a different and lucid approach.

The set of arithmetic truths is neither recursive, nor recursively enumerable. Mathematician Alexander Kharazishvili explores how powerful the celebrated diagonal method is for general and descriptive set theory, recursion theory, and Gödel’s incompleteness theorem.

Metamathematics is the mathematical study of mathematics itself. Two of its most famous theorems were proved by Kurt Gödel in 1931. In a simplified form, Gödel's first incompleteness theorem states that no reasonable mathematical system can prove all the truths of mathematics. Gödel's second incompleteness theorem (also simplified) in turn states that no reasonable mathematical system can prove its own consistency. Another famous undecidability theorem is that the Continuum Hypothesis is neither provable nor refutable in standard set theory. Many of us logicians were first attracted to the field as students because we had heard something of these results. All research mathematicians know something of them too, and have at least a rough sense of why ‘we can't prove everything we want to prove’.