Abstract
This chapter provides an introduction to set-theoretic assumptions, such as Martin's axiom and ◇, unearthed by set theorists and illustrates how these can be used in proving topological theorems or constructing counter examples. The notation used in the chapter follows JUHÁSZ; one exception is the tightness that is denoted by t(X). The chapter also presents the applications of Martin's axiom. Further, the chapter discusses combinatorial principles valid in L.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have