- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Approachability and games on posets
Journal of Symbolic Logic 68 (2):589-606 (2003)
Abstract
We show that for any infinite cardinal κ, every strongly $(\kappa + 1)-strategically$ closed poset is strongly $\kappa^+-strategically$ closed if and only if $AP_\kappa$ (the approachability property) holds, answering the question asked in [5]. We also give a complete classification of strengths of strategic closure properties and that of strong strategic closure properties respectivelyLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
More on cichoń's diagram and infinite games.Masaru Kada - 2000 - Journal of Symbolic Logic 65 (4):1713-1724.
Abstract Elementary Classes with Löwenheim-Skolem Number Cofinal with ω.Gregory M. Johnson - 2010 - Notre Dame Journal of Formal Logic 51 (3):361-371.
Polarized partition relations.James E. Baumgartner & Andras Hajnal - 2001 - Journal of Symbolic Logic 66 (2):811-821.
A Gitik iteration with nearly Easton factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
Extender based forcings.Moti Gitik & Menachem Magidor - 1994 - Journal of Symbolic Logic 59 (2):445-460.
The stability function of a theory.H. Jerome Keisler - 1978 - Journal of Symbolic Logic 43 (3):481-486.
Ultrafilters generated by a closed set of functions.Greg Bishop - 1995 - Journal of Symbolic Logic 60 (2):415-430.
Strong Compactness and Stationary Sets.John Krueger - 2005 - Journal of Symbolic Logic 70 (3):767 - 777.
Analytics
Added to PP
2009-01-28
Downloads
50 (#304,573)
6 months
7 (#350,235)
2009-01-28
Downloads
50 (#304,573)
6 months
7 (#350,235)
Historical graph of downloads
Citations of this work
Fragments of Martin's Maximum in generic extensions.Y. Yoshinobu & B. Konig - 2004 - Mathematical Logic Quarterly 50 (3):297.
Forcing Indestructibility of Set-Theoretic Axioms.Bernhard König - 2007 - Journal of Symbolic Logic 72 (1):349 - 360.
Operations, climbability and the proper forcing axiom.Yasuo Yoshinobu - 2013 - Annals of Pure and Applied Logic 164 (7-8):749-762.
Destructibility of stationary subsets of Pκλ.Sakaé Fuchino & Greg Piper - 2005 - Mathematical Logic Quarterly 51 (6):560-569.
References found in this work
Squares, scales and stationary reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (01):35-98.
Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo