Atlas home || Conferences | Abstracts | about Atlas

Boise Extravaganza in Set Theory
March 25-26, 2007
Knotty Pines Kabins
Idaho City, ID, USA

Organizers
Liljana Babinkostova, Stefan Geschke, Justin Moore, and Marion Scheepers

View Abstracts
Conference Homepage

On the strength of admissible determinacy
by
Andres Caicedo
California Institute of Technology
Coauthors: Diego Rojas

For a real x let rx=w1CK(x) be the first ordinal not recursive in x and let Mx=Lrx[x], so Mx is the smallest transitive model of KP that has x as an element. Originally considered by Andy Lewis, admissible determinacy is the statement that there is a real x such that Mx satisfies Ordinal Determinacy. We present some partial results towards determining the consistency strength of this hypothesis.

Date received: February 21, 2007


Copyright © 2007 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caty-05.