Games of Countable Length

Bulletin of Symbolic Logic 11 (4):542-544 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Games of length ω1.Itay Neeman - 2007 - Journal of Mathematical Logic 7 (1):83-124.
How to win some simple iteration games.Alessandro Andretta & John Steel - 1997 - Annals of Pure and Applied Logic 83 (2):103-164.
The stationary set splitting game.Paul B. Larson & Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (2):187-193.
Determinacy for Games Ending at the First Admissible Relative to the Play.Itay Neeman - 2006 - Journal of Symbolic Logic 71 (2):425 - 459.
Countable Fréchetα 1-spaces may be first countable.Alan Dow & Juris Stepräns - 1992 - Archive for Mathematical Logic 32 (1):33-50.
Backward Induction without Common Knowledge.Cristina Bicchieri - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:329 - 343.
On non‐determined ehrenfeucht‐fraïssé games and unstable theories.Tapani Hyttinen & T. Hyttinen - 1992 - Mathematical Logic Quarterly 38 (1):399-408.
The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.
Many countable support iterations of proper forcings preserve Souslin trees.Heike Mildenberger & Saharon Shelah - 2014 - Annals of Pure and Applied Logic 165 (2):573-608.
The length of some diagonalization games.Marion Scheepers - 1999 - Archive for Mathematical Logic 38 (2):103-122.
The axiom of choice for countable collections of countable sets does not imply the countable union theorem.Paul E. Howard - 1992 - Notre Dame Journal of Formal Logic 33 (2):236-243.
A cardinal preserving extension making the set of points of countable V cofinality nonstationary.Moti Gitik, Itay Neeman & Dima Sinapova - 2007 - Archive for Mathematical Logic 46 (5-6):451-456.
Winning strategies in club games and their applications.Bernhard König - 2011 - Mathematical Logic Quarterly 57 (1):19-26.
What is length?Frank Henmueller & Karl Menger - 1961 - Philosophy of Science 28 (2):172-177.
Unraveling Π11 sets.Itay Neeman - 2000 - Annals of Pure and Applied Logic 106 (1-3):151-205.

Analytics

Added to PP
2015-02-06

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references