SearcharxivSearch

arXiv · 2109.11652

The $\Pi^1_2$ Consequences of a Theory

Abstract

We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the use of ordinal numbers by particularly uniform, wellfoundedness preserving functors in the category of linear orders. Generalizing the notion of a proof-theoretic ordinal, we define the functorial $\Pi^1_2$ norm of a theory and prove its existence and uniqueness for $\Pi^1_2$-sound theories. From this, we further abstract a definition of the $\Sigma^1_2$- and $\Pi^1_2$-soundness ordinals of a theory; these quantify, respectively, the maximum strength of true $\Sigma^1_2$ theorems and minimum strength of false $\Pi^1_2$ theorems of a given theory. We study these ordinals, developing a proof-theoretic classification theory for recursively enumerable extensions of $\mathsf{ACA}_0$ Using techniques from infinitary and categorical proof theory, generalized recursion theory, constructibility, and forcing, we prove that an admissible ordinal is the $\Pi^1_2$-soundness ordinal of some recursively enumerable extension of $\mathsf{ACA}_0$ if and only if it is not parameter-free $\Sigma^1_1$-reflecting. We show that the $\Sigma^1_2$-soundness ordinal of $\mathsf{ACA}_0$ is $\omega_1^{ck}$ and characterize the $\Sigma^1_2$-soundness ordinals of recursively enumerable, $\Sigma^1_2$-sound extensions of $\Pi^1_1{-}\mathsf{CA}_0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan P. Aguilera, Fedor Pakhomov. 2021-09-23. The $\Pi^1_2$ Consequences of a Theory. https://arxiv.org/abs/2109.11652

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