The structure of -like orderings
Victor Harnik, Mark Nadel, Jonathan Stavi (1986)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “ equivalence between countable and uncountable linear orderings”
The structure of -like orderings
Vaught's conjecture for theories of one unary operation
Arnold Miller (1981)
Fundamenta Mathematicae
Similarity:
Determinateness in the low protective hierarchy
Harvey Friedman (1971)
Fundamenta Mathematicae
Similarity:
More Lusin properties in the product space
G. Cox (1981)
Fundamenta Mathematicae
Similarity:
On the netweight of subspaces
Krzysztof Ciesielski (1983)
Fundamenta Mathematicae
Similarity:
The number of countable models of a theory of one unary function
Leo Marcus (1980)
Fundamenta Mathematicae
Similarity:
Are most measurable functions one-to-one?
van Douwen, E.K., Stone, A.H. (1992)
Portugaliae mathematica
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...
Generalized Ehrenfeucht games
Martin Weese (1980)
Fundamenta Mathematicae
Similarity:
A Cantor-Bendixson theorem for the space
Jouko Väänänen (1991)
Fundamenta Mathematicae
Similarity: