Determinateness in the low protective hierarchy
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “Iteration of -complete forcing notions not collapsing .”
Determinateness in the low protective hierarchy
Measurable cardinals and analytic games
Donald Matrin (1970)
Fundamenta Mathematicae
Similarity:
On the netweight of subspaces
Krzysztof Ciesielski (1983)
Fundamenta Mathematicae
Similarity:
The Axiom of Determinateness and canonical measures
James Henle (1981)
Fundamenta Mathematicae
Similarity:
On the open-open game
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...
Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions.
Kruczek, Klay, Sundberg, Eric (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axiomatization of the forcing relation with an application to Peano Arithmetic
Zofia Adamowicz (1984)
Fundamenta Mathematicae
Similarity:
On solving games constructed using both short and long conjunctive sums.
Kane, Daniel M. (2010)
Integers
Similarity:
A simple proof that determinacy implies Lebesgue measurability.
Martin, D.A. (2003)
Rendiconti del Seminario Matematico
Similarity:
2-pile Nim with a restricted number of move-size imitations.
Larsson, Urban (2009)
Integers
Similarity:
Degrees of indeterminacy of games
Andreas Blass (1972)
Fundamenta Mathematicae
Similarity: