Dependent choice and iterated beta n-model reflection

arXiv:2610.36982 · math.LO · Submitted 2026-10-27 · Read on arXiv

math.LO

Submitted: 2026-10-27

Updated: 2026-10-27

License: http://creativecommons.org/licenses/by/4.0/

The gist: In this paper, we consider conservation results for iterated β n-model reflection principles.

Abstract

In this paper, we consider conservation results for iterated β n-model reflection principles. Using these principles, we characterize the Π 1 m+2 -, Σ 1 m+2 - and (Π 1 m+2) -consequences of Σ 1 n+1 - 0 and Σ 1 n+1 - 0 for m at most n. Here, (Π 1 m+2) denotes the set of Boolean combinations of Π 1 m+2-formulas, and stands for transfinite. We also show that, in each case, the stronger theory has a super-exponential speed-up over the corresponding conservative subtheory.

Related papers