Turing determinacy and the continuum hypothesis

Archive for Mathematical Logic 28 (3):149-154 (1989)
  Copy   BIBTEX

Abstract

From the hypothesis that all Turing closed games are determined we prove: (1) the Continuum Hypothesis and (2) every subset of ℵ1 is constructible from a real

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-11-23

Downloads
36 (#385,180)

6 months
2 (#670,035)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Axiom I 0 and higher degree theory.Xianghui Shi - 2015 - Journal of Symbolic Logic 80 (3):970-1021.
Uniformity, universality, and computability theory.Andrew S. Marks - 2017 - Journal of Mathematical Logic 17 (1):1750003.
Some Consequences of And.Yinhe Peng, W. U. Liuzhen & Y. U. Liang - 2023 - Journal of Symbolic Logic 88 (4):1573-1589.

Add more citations

References found in this work

Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Descriptive Set Theory.Richard Mansfield - 1981 - Journal of Symbolic Logic 46 (4):874-876.
Higher set theory and mathematical practice.Harvey M. Friedman - 1971 - Annals of Mathematical Logic 2 (3):325.
Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.

Add more references