Annals of Pure and Applied Logic 92 (3):267-282 (1998)
Abstract |
The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem gives a necessary and sufficient condition for the existence of an exact upper bound ƒ for a ¦A¦+ is regular: an eub ƒ with lim infI cf ƒ = μ exists if and only if for every regular κ ε the set of flat points in tf of cofinality κ is stationary. Two applications of the main Theorem to set theory are presented. A theorem of Magidor's on covering between models of ZFC is proved using the main theorem : If V-W are transitive models of set theory with ω-covering and GCH holds in V, then κ-covering holds between V and W for all cardinals κ. A new proof of a Theorem by Cummings on collapsing successors of singulars is also given . The appendix to the paper contains a short proof of Shelah's trichotomy theorem, for the reader's convenience
|
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.1016/s0168-0072(98)00011-6 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
Shelah's Pcf Theory and its Applications.Maxim R. Burke & Menachem Magidor - 1990 - Annals of Pure and Applied Logic 50 (3):207-254.
Citations of this work BETA
The PCF Trichotomy Theorem Does Not Hold for Short Sequences.Menachem Kojman & Saharon Shelah - 2000 - Archive for Mathematical Logic 39 (3):213-218.
An Extension of Shelah’s Trichotomy Theorem.Shehzad Ahmed - 2019 - Archive for Mathematical Logic 58 (1-2):137-153.
Fallen Cardinals.Menachem Kojman & Saharon Shelah - 2001 - Annals of Pure and Applied Logic 109 (1-2):117-129.
Similar books and articles
Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory.Gerhard Jäger & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
More About Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Models of Arithmetic and Upper Bounds for Arithmetic Sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Exact Bounds for Lengths of Reductions in Typed Λ-Calculus.Arnold Beckmann - 2001 - Journal of Symbolic Logic 66 (3):1277-1285.
Low Upper Bounds of Ideals.Antonín Kučera & Theodore A. Slaman - 2009 - Journal of Symbolic Logic 74 (2):517-534.
About Conditional Probabilities of Events Regarding the Quantum Mechanical Measurement Process.Thomas Schürmann - unknown
The Strength of Martin-Löf Type Theory with a Superuniverse. Part II.Michael Rathjen - 2001 - Archive for Mathematical Logic 40 (3):207-233.
An Exact Pair for the Arithmetic Degrees Whose Join is Not a Weak Uniform Upper Bound.Harold T. Hodes - 1982 - Recursive Function Theory-Newsletters 28.
Upper Bounds on Locally Countable Admissible Initial Segments of a Turing Degree Hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
Low Upper Bounds in the LR Degrees.David Diamondstone - 2012 - Annals of Pure and Applied Logic 163 (3):314-320.
Upper Bounds for the Arithmetical Degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Minimal Upper Bounds for Arithmetical Degrees.Masahiro Kumabe - 1994 - Journal of Symbolic Logic 59 (2):516-528.
An o-Space Decision Procedure for the Relevance Logic B+.Luca Viganò - 2000 - Studia Logica 66 (3):385-407.
Analytics
Added to PP index
2014-01-16
Total views
10 ( #896,026 of 2,498,734 )
Recent downloads (6 months)
1 ( #426,098 of 2,498,734 )
2014-01-16
Total views
10 ( #896,026 of 2,498,734 )
Recent downloads (6 months)
1 ( #426,098 of 2,498,734 )
How can I increase my downloads?
Downloads