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

Other Versions

No versions found

Links

PhilArchive

External links

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

Through your library

Similar books and articles

Provably games.J. P. Aguilera & D. W. Blue - forthcoming - Journal of Symbolic Logic:1-22.
Indescribable cardinals without diamonds.Kai Hauser - 1992 - Archive for Mathematical Logic 31 (5):373-383.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Some Calkin algebras have outer automorphisms.Ilijas Farah, Paul McKenney & Ernest Schimmerling - 2013 - Archive for Mathematical Logic 52 (5):517-524.
TheL <ω-theory of the class of Archimedian real closed fields.Gerd Bürger - 1989 - Archive for Mathematical Logic 28 (3):155-166.
The canonical function game.Paul B. Larson - 2005 - Archive for Mathematical Logic 44 (7):817-827.
On two consequences of CH established by Sierpiński. II.R. Pol & P. Zakrzewski - 2025 - Archive for Mathematical Logic 64 (7):1149-1164.

Analytics

Added to PP
2013-11-23

Downloads
126 (#361,965)

6 months
31 (#298,472)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Some Consequences of And.Yinhe Peng, W. U. Liuzhen & Y. U. Liang - 2023 - Journal of Symbolic Logic 88 (4):1573-1589.
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.

Add more citations