Guessing and non-guessing of canonical functions

Annals of Pure and Applied Logic 146 (2):150-179 (2007)
  Copy   BIBTEX

Abstract

It is possible to control to a large extent, via semiproper forcing, the parameters measuring the guessing density of the members of any given antichain of stationary subsets of ω1 . Here, given a pair of ordinals, we will say that a stationary set Sω1 has guessing density if β0=γ and , where γ is, for every stationary S*ω1, the infimum of the set of ordinals τ≤ω1+1 for which there is a function with ot)<τ for all νS* and with {νS*:gF} stationary for every α<ω2 and every canonical function g for α. This work involves an analysis of iterations of models of set theory relative to sequences of measures on possibly distinct measurable cardinals. As an application of these techniques I show how to force, from the existence of a supercompact cardinal, a model of in which there is a well-order of H definable, over H,, by a formula without parameters

Links

PhilArchive



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

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

Some results about (+) proved by iterated forcing.Tetsuya Ishiu & Paul B. Larson - 2012 - Journal of Symbolic Logic 77 (2):515-531.
Club guessing sequences and filters.Tetsuya Ishiu - 2005 - Journal of Symbolic Logic 70 (4):1037-1071.
Club Guessing and the Universal Models.Mirna Džamonja - 2005 - Notre Dame Journal of Formal Logic 46 (3):283-300.
The processes involved in the repeated guessing of alternatives.B. F. Skinner - 1942 - Journal of Experimental Psychology 30 (6):495.
Guessing and the order of approximation effect.Lester A. Lefton - 1973 - Journal of Experimental Psychology 101 (2):401.
Short-term memory with a guessing technique.James V. Hinrichs - 1966 - Journal of Experimental Psychology 71 (1):89.
Effects of round number preferences in a guessing task.Bruce M. Ross & Trygg Engen - 1959 - Journal of Experimental Psychology 58 (6):462.
Notes on Singular Cardinal Combinatorics.James Cummings - 2005 - Notre Dame Journal of Formal Logic 46 (3):251-282.

Analytics

Added to PP
2013-12-30

Downloads
18 (#781,713)

6 months
7 (#339,156)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

David Aspero
University of East Anglia

Citations of this work

Martin’s Maximum and definability in H.Paul B. Larson - 2008 - Annals of Pure and Applied Logic 156 (1):110-122.
On a convenient property about $${[\gamma]^{\aleph_0}}$$.David Asperó - 2009 - Archive for Mathematical Logic 48 (7):653-677.

Add more citations

References found in this work

Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.
Bounded forcing axioms as principles of generic absoluteness.Joan Bagaria - 2000 - Archive for Mathematical Logic 39 (6):393-401.
Some applications of iterated ultrapowers in set theory.Kenneth Kunen - 1970 - Annals of Mathematical Logic 1 (2):179.
Semiproper forcing axiom implies Martin maximum but not PFA+.Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):360-367.
XVI. A model for the negation of the axiom of choice.Kenneth Kunen - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 489--494.

View all 7 references / Add more references