An extension of Shelah’s trichotomy theorem

Archive for Mathematical Logic 58 (1-2):137-153 (2019)
  Copy   BIBTEX

Abstract

Shelah develops the theory of \\) without the assumption that \\), going so far as to get generators for every \\) under some assumptions on I. Our main theorem is that we can also generalize Shelah’s trichotomy theorem to the same setting. Using this, we present a different proof of the existence of generators for \\) which is more in line with the modern exposition. Finally, we discuss some obstacles to further generalizing the classical theory.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,362

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

Representability and compactness for pseudopowers.Todd Eisworth - 2021 - Archive for Mathematical Logic 61 (1):55-80.
Non-forking w-good frames.Marcos Mazari-Armida - 2020 - Archive for Mathematical Logic 59 (1-2):31-56.
A proof of Shelah's partition theorem.Menachem Kojman - 1995 - Archive for Mathematical Logic 34 (4):263-268.
Local order property in nonelementary classes.Rami Grossberg & Olivier Lessmann - 2000 - Archive for Mathematical Logic 39 (6):439-457.
A note on extensions of infinitary logic.Saharon Shelah & Jouko Väänänen - 2005 - Archive for Mathematical Logic 44 (1):63-69.
An inner model theoretic proof of Becker’s theorem.Grigor Sargsyan - 2019 - Archive for Mathematical Logic 58 (7-8):999-1003.
A game‐theoretic proof of Shelah's theorem on labeled trees.Trevor M. Wilson - 2020 - Mathematical Logic Quarterly 66 (2):190-194.
Positive logics.Saharon Shelah & Jouko Väänänen - 2023 - Archive for Mathematical Logic 62 (1):207-223.
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.

Analytics

Added to PP
2018-05-09

Downloads
20 (#919,299)

6 months
5 (#923,890)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
Exact upper bounds and their uses in set theory.Menachem Kojman - 1998 - Annals of Pure and Applied Logic 92 (3):267-282.

Add more references