Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T15:02:55.577Z Has data issue: false hasContentIssue false

Weak systems of determinacy and arithmetical quasi-inductive definitions

Published online by Cambridge University Press:  12 March 2014

P. D. Welch*
Affiliation:
School of Mathematics, University of Bristol, Bristol, BS8 1TW, UK, E-mail: p.welch@bristol.ac.uk

Abstract

We locate winning strategies for various -games in the L-hierarchy in order to prove the following:

Theorem 1. KP + Σ2-Comprehension -Determinacy.”

Alternatively: “there is a β-model of-Determinacy.” The implication is not reversible. (The antecedent here may be replaced with instances of Comprehension with only -lightface definable parameters—or even weaker theories.)

Theorem 2. KP + Δ2-Comprehension + Σ2-Replacement + -Determinacy.

(Here AQI is the assertion that every arithmetical quasi-inductive definition converges.) Alternatively: -Determinacy.

Hence the theories: , and are in strictly descending order of strength.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable