Page 1

Displaying 1 – 7 of 7

Showing per page

Sandwiching the Consistency Strength of Two Global Choiceless Cardinal Patterns

Arthur W. Apter (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

We provide upper and lower bounds in consistency strength for the theories “ZF + ¬ A C ω + All successor cardinals except successors of uncountable limit cardinals are regular + Every uncountable limit cardinal is singular + The successor of every uncountable limit cardinal is singular of cofinality ω” and “ZF + ¬ A C ω + All successor cardinals except successors of uncountable limit cardinals are regular + Every uncountable limit cardinal is singular + The successor of every uncountable limit cardinal is singular...

Singular cardinals and strong extenders

Arthur Apter, James Cummings, Joel Hamkins (2013)

Open Mathematics

We investigate the circumstances under which there exist a singular cardinal µ and a short (κ,µ)-extender E witnessing “κ is µ-strong”, such that µ is singular in Ult(V, E).

Some applications of Sargsyan's equiconsistency method

Arthur W. Apter (2012)

Fundamenta Mathematicae

We apply techniques due to Sargsyan to reduce the consistency strength of the assumptions used to establish an indestructibility theorem for supercompactness. We then show how these and additional techniques due to Sargsyan may be employed to establish an equiconsistency for a related indestructibility theorem for strongness.

Stationary reflection in extender models

Ernest Schimmerling (2005)

Fundamenta Mathematicae

Working in L[E], we examine which large cardinal properties of κ imply that all stationary subsets of cof(<κ) ∩ κ⁺ reflect.

Strong covering without squares

Saharon Shelah (2000)

Fundamenta Mathematicae

Let W be an inner model of ZFC. Let κ be a cardinal in V. We say that κ-covering holds between V and W iff for all X ∈ V with X ⊆ ON and V ⊨ |X| < κ, there exists Y ∈ W such that X ⊆ Y ⊆ ON and V ⊨ |Y| < κ. Strong κ-covering holds between V and W iff for every structure M ∈ V for some countable first-order language whose underlying set is some ordinal λ, and every X ∈ V with X ⊆ λ and V ⊨ |X| < κ, there is Y ∈ W such that X ⊆ Y ≺ M and V ⊨ |Y| < κ.   We prove that if κ is V-regular,...

Currently displaying 1 – 7 of 7

Page 1