Switch to: Citations

Add references

You must login to add references.
  1. The length of some diagonalization games.Marion Scheepers - 1999 - Archive for Mathematical Logic 38 (2):103-122.
    For X a separable metric space and $\alpha$ an infinite ordinal, consider the following three games of length $\alpha$ : In $G^{\alpha}_1$ ONE chooses in inning $\gamma$ an $\omega$ –cover $O_{\gamma}$ of X; TWO responds with a $T_{\gamma}\in O_{\gamma}$ . TWO wins if $\{T_{\gamma}:\gamma<\alpha\}$ is an $\omega$ –cover of X; ONE wins otherwise. In $G^{\alpha}_2$ ONE chooses in inning $\gamma$ a subset $O_{\gamma}$ of ${\sf C}_p(X)$ which has the zero function $\underline{0}$ in its closure, and TWO responds with a function (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Near coherence of filters. III. A simplified consistency proof.Andreas Blass & Saharon Shelah - 1989 - Notre Dame Journal of Formal Logic 30 (4):530-538.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Near coherence of filters. I. Cofinal equivalence of models of arithmetic.Andreas Blass - 1986 - Notre Dame Journal of Formal Logic 27 (4):579-591.
    Download  
     
    Export citation  
     
    Bookmark   17 citations