|Time:|| 12:00 - 13:20
Wean Hall 7201
Department of Mathematical Sciences
Carnegie Mellon University
We define a class of guessing models, introduced by Viale and Weiss. The existence of guessing models is equivalent to the principle: every slender list has an ineffable branch. The latter, captures many combinatorial structures of supercompactness and yet can hold at successor cardinals, was isolated and studied by Weiss. We discuss consistency strength and prove some combinatorial consequences of the existence of guessing models.