Determinacy and reflection principles in second-order arithmetic

arXiv2209.04082MaRDI QIDQ6410163FDOQ6410163

Publication date: 8 September 2022

Abstract: It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb'an, Shore, and others. We prove variations of a result by Ko{l}odziejczyk and Michalewski relating determinacy of arbitrary boolean combinations of

S i g m a_{2}^{0}

sets and reflection in second-order arithmetic. Specifically, we prove that: over

m a t h s f {A C A}_{0}

,

P i_{2}^{1}

-

m a t h s f R e f (m a t h s f {A C A}_{0})

is equivalent to

f o r a l l n . (S i g m a_{1}^{0})_{n}

-

m a t h s f {D e t}_{0}^{*}

;

P i_{3}^{1}

-

m a t h s f R e f (P i_{1}^{1}

-

m a t h s f {C A}_{0})

is equivalent to

f o r a l l n . (S i g m a_{1}^{0})_{n}

-

m a t h s f D e t

; and

P i_{3}^{1}

-

m a t h s f R e f (P i_{2}^{1}

-

m a t h s f {C A}_{0})

is equivalent to

f o r a l l n . (S i g m a_{2}^{0})_{n}

-

m a t h s f D e t

. We also restate results by Montalb'an and Shore to show that

P i_{3}^{1}

-

m a t h s f R e f (m a t h s f Z_{2})

is equivalent to

f o r a l l n . (S i g m a_{3}^{0})_{n}

-

m a t h s f D e t

over

m a t h s f {A C A}_{0}

.

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Relative consistency and interpretations (03F25) Nonstandard models of arithmetic (03H15)

This page was built for publication: Determinacy and reflection principles in second-order arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410163)