TY - JOUR
T1 - On a theorem of silver
AU - Baumgartner, J. E.
AU - Prikry, K.
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 1976
Y1 - 1976
N2 - A recent theorem of Silver, in its simplest form, states, that if ω < cf(k) < k and 2λ=λ+ for all λ < k, then 2k=k+. Silver's proof employs Boolean-valued as well as nonstandard models of set theory. In the present note we give an elementary proof of Silver's theorem in its general form.
AB - A recent theorem of Silver, in its simplest form, states, that if ω < cf(k) < k and 2λ=λ+ for all λ < k, then 2k=k+. Silver's proof employs Boolean-valued as well as nonstandard models of set theory. In the present note we give an elementary proof of Silver's theorem in its general form.
UR - http://www.scopus.com/inward/record.url?scp=33646054925&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33646054925&partnerID=8YFLogxK
U2 - 10.1016/0012-365X(76)90002-9
DO - 10.1016/0012-365X(76)90002-9
M3 - Article
AN - SCOPUS:33646054925
SN - 0012-365X
VL - 14
SP - 17
EP - 21
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1
ER -