Some Results on Tight Stationarity, University of California, Los Angeles, USA, 2016. Supervised by Itay Neeman

Bulletin of Symbolic Logic 24 (2):198-199 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Square principles with tail-end agreement.William Chen & Itay Neeman - 2015 - Archive for Mathematical Logic 54 (3-4):439-452.
Tight stationarity and tree-like scales.William Chen - 2015 - Annals of Pure and Applied Logic 166 (10):1019-1036.
Games of length ω1.Itay Neeman - 2007 - Journal of Mathematical Logic 7 (1):83-124.
The tree property up to אω+1.Itay Neeman - 2014 - Journal of Symbolic Logic 79 (2):429-459.
The Determinacy of Long Games.Itay Neeman - 2006 - Bulletin of Symbolic Logic 12 (2):299-302.
Games of Countable Length.Itay Neeman - 2005 - Bulletin of Symbolic Logic 11 (4):542-544.
Optimal proofs of determinacy.Itay Neeman - 1995 - Bulletin of Symbolic Logic 1 (3):327-339.
Optimal proofs of determinacy II.Itay Neeman - 2002 - Journal of Mathematical Logic 2 (2):227-258.
Happy and mad families in L.Itay Neeman & Zach Norwood - 2018 - Journal of Symbolic Logic 83 (2):572-597.
The strength of Jullien's indecomposability theorem.Itay Neeman - 2008 - Journal of Mathematical Logic 8 (1):93-119.

Analytics

Added to PP
2018-08-08

Downloads
6 (#1,443,383)

6 months
2 (#1,221,975)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

William Chen
Reed College

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references