Determinateness in the low protective hierarchy
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
Peg Daniels, Kenneth Kunen, Haoxuan Zhou (1994)
Fundamenta Mathematicae
Similarity:
We modify a game due to Berner and Juhász to get what we call “the open-open game (of length ω)”: a round consists of player I choosing a nonempty open subset of a space X and II choosing a nonempty open subset of I’s choice; I wins if the union of II’s open sets is dense in X, otherwise II wins. This game is of interest for ccc spaces. It can be translated into a game on partial orders (trees and Boolean algebras, for example). We present basic results and various conditions under which...
Donald Matrin (1970)
Fundamenta Mathematicae
Similarity:
Krzysztof Ciesielski (1983)
Fundamenta Mathematicae
Similarity:
C. Yates (1974)
Fundamenta Mathematicae
Similarity:
Grzegorz Kubicki (1987)
Colloquium Mathematicae
Similarity:
G. Debs, J. Saint Raymond (1996)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
E. C. Milner (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
Jiří Matoušek, Martin Loebl (1991)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill...