Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.10302

Reflection algebras and conservation results for theories of iterated truth

Lev D. Beklemishev·Fedor N. Pakhomov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original system of arithmetic. Much stronger systems, however, are obtained by adding either induction axioms or reflection axioms on top of them. Theories of this kind can interpret some well-known predicatively reducible fragments of second-order arithmetic such as iterated arithmetical comprehension. We obtain sharp results on the proof-theoretic strength of these systems using methods of provability logic. Reflection principles naturally define unary operators acting on the semilattice of axiomatizable extensions of our basic theory of iterated truth. The substructure generated by the top element of this algebra provides a canonical ordinal notation system for the class of theories under investigation. Using these notations we obtain conservativity relationships for iterated reflection principles of different logical complexity levels corresponding to the levels of the hyperarithmetical hierarchy, i.e., the analogs of Schmerl's formulas. These relationships, in turn, provide proof-theoretic analysis of our systems and of some related predicatively reducible theories. In particular, we uniformly calculate the ordinals characterizing the standard measures of their proof-theoretic strength, such as provable well-orderings, classes of provably recursive functions, and $\Pi_1^0$-ordinals.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Lev D. Beklemishev, Fedor N. Pakhomov. 2019-08-27. Reflection algebras and conservation results for theories of iterated truth. https://arxiv.org/abs/1908.10302

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗