SearcharxivSearch

arXiv · 2111.10716

Implications between Induction Principles for $\mathbb{N}$ in Peano Arithmetic

Abstract

In introductory books about natural numbers, a common kind of assertion - often left as exercise to the reader - is that certain forms of induction on $\mathbb{N}$ (regular/ordinary, complete/strong) are equivalent one to each other and to the well-ordering principle. This means that if P1 and P2 are two of these principles, then, under all the other usually adopted postulates for the set of natural numbers (e.g., Peano axioms other than the induction axiom), P1 implies P2 and vice-versa. In this paper, we shows that, for a reasonable formalization, based on Peano arithmetic, some of the alleged implications between these principles hold only if an additional, independent condition is assumed, namely: every nonzero natural number is a successor. This condition is a consequence of the regular induction principle, but not of other induction principles. So, it is necessary to review all currently accepted implications between induction principles and similar statements in $\mathbb{N}$. From a list of 9 properties, usually considered induction principles (or equivalent to), we identify all valid and "almost valid" implications between them, as well as disprove all invalid implications by counterexamples, which consist of structures similar to Peano models, but not necessarily satisfying the Peano's induction axiom, and having an order relation adequately subordinated to the zero and the successors. Final remarks are made about what can and what cannot be proved if we weaken the assumptions about the order relation. The aim of this paper is to shed light on the need for more caution when alleging equivalence between induction principles for $\mathbb{N}$.

Explore related subjects

Keep this discovery

BibTeXRIS

João Alves Silva Júnior. 2021-11-21. Implications between Induction Principles for $\mathbb{N}$ in Peano Arithmetic. https://arxiv.org/abs/2111.10716

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO