Search arXiv⌕ Search

arXiv · 1807.05641

The Consistency of Arithmetic

Abstract

In 2010, Vladimir Voevodsky gave a lecture on "What If Current Foundations of Mathematics Are Inconsistent?" Among other things he said that he was seriously suspicious that an inconsistency in PA (first-order Peano arithmetic) might someday be found. About a year later, Edward Nelson announced that he had discovered an inconsistency not just in PA, but in a small fragment of primitive recursive arithmetic. Soon, Daniel Tausk and Terence Tao independently found a fatal error, and Nelson withdrew his claim, stating that consistency of PA was an "open problem." Many mathematicians may find such claims bewildering. Is the consistency of PA really an open problem? If so, would the discovery of an inconsistency in PA cause all of mathematics to come crashing down like a house of cards? This expository article attempts to address these questions, by sketching and discussing existing proofs of the consistency of PA (including Gentzen's proof and Friedman's relative consistency proof that appeals to the Bolzano-Weierstrass theorem). Since Nelson was a self-avowed formalist, the article also examines the implications of formalism.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy Y. Chow. 2018-07-16. The Consistency of Arithmetic. https://arxiv.org/abs/1807.05641

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗

On some NIP Fragments of Fields

In this document we study sets of NIP formulas in some theories of fields and valued fields, with a special focus on the sets of quantifier-free and existential formulas. First, we give a new proof of the fact that Separably Closed Valued Fields of any characteristic and any imperfection degree are NIP, and use this result to fill some gaps of a proof of the so-called NIP Transfer Theorem for henselian valued fields of equal characteristic. Second, we prove a variant of a theorem of Johnson: every positive characteristic valued field whose existential formulas are NIP is henselian, and generalize this result for finer sets of existential formulas, like positive existential with a given number of quantifiers, in type-definable fields. Finally, we set the ground for the finer question of transfer of NIP formulas of valued fields with bounded quantifier rank. Namely, we prove that for any henselian equicharacteristic valued field, any formula of quantifier rank at most $n\geq 1$ is NIP if and only if the same is true for the residue field and the value group, provided that the valued field is separably defectless Kaplansky and conditional on a multi-variable generalization of a well known statement about indiscernible sequences of singletons in ac-valued fields.

math.LO↗

Combinatorics of Schur ultrafilters

In this paper, we provide a combinatorial characterization of the elements of Schur ultrafilters on countable commutative groups. Using this characterization, we construct a Schur ultrafilter on $\mathbb Z$ that is not infinitary Schur. Moreover, assuming the Continuum Hypothesis, we establish the existence of Schur P-points in $β(\mathbb Z)$. On the other hand, it is consistent with ZFC that there exist P-points in $β(\mathbb Z)$, but none of them are Schur. Also, we extend the result of Fernández-Bretón, Navarro-Castillo, and Soria-Rojas by showing that no Schur ultrafilter on $\mathbb Z$ is a Q-point.

math.LO↗