On long increasing chains modulo flat ideals

Mathematical Logic Quarterly 56 (4):397-399 (2010)
  Copy   BIBTEX

Abstract

We prove that, e.g., in there is no sequence of length W4 increasing modulo the ideal of countable sets

Categories

Keywords

Reprint years

DOI

10.1002/malq.200910010

Links

PhilArchive



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

External links

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

Forcing with quotients.Michael Hrušák & Jindřich Zapletal - 2008 - Archive for Mathematical Logic 47 (7-8):719-739.
Forcing properties of ideals of closed sets.Marcin Sabok & Jindřich Zapletal - 2011 - Journal of Symbolic Logic 76 (3):1075 - 1095.
Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
The PCF Trichotomy Theorem does not hold for short sequences.Menachem Kojman & Saharon Shelah - 2000 - Archive for Mathematical Logic 39 (3):213-218.
Maximal chains inωω and ultrapowers of the integers.Saharon Shelah & Juris Steprāns - 1993 - Archive for Mathematical Logic 32 (5):305-319.
Possible size of an ultrapower of $\omega$.Renling Jin & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (1):61-77.
Etudes in κ-m-proper forcing.Charles Morgan - unknown
Syntax in chains.Marcus Kracht - 2001 - Linguistics and Philosophy 24 (4):467-530.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
Borel reductions and cub games in generalised descriptive set theory.Vadim Kulikov - 2013 - Journal of Symbolic Logic 78 (2):439-458.
A remark on Martin's conjecture.Su Gao - 2001 - Journal of Symbolic Logic 66 (1):401-406.
Limitwise monotonic functions, sets, and degrees on computable domains.Asher M. Kach & Daniel Turetsky - 2010 - Journal of Symbolic Logic 75 (1):131-154.
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
Chains and antichains in partial orderings.Valentina S. Harizanov, Carl G. Jockusch & Julia F. Knight - 2009 - Archive for Mathematical Logic 48 (1):39-53.

Analytics

Added to PP
2013-12-01

Downloads
18 (#828,704)

6 months
2 (#1,186,462)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On constructions with 2-cardinals.Piotr Koszmider - 2017 - Archive for Mathematical Logic 56 (7-8):849-876.

Add more citations

References found in this work

Applications of PCF theory.Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (4):1624-1674.
More on cardinal arithmetic.Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (6):399-428.
Applications of PCF theory.Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (4):1624-1674.

Add more references