Independence of CH: Forcing

Serafim Batzoglou
Additional contact information
Serafim Batzoglou: Seer Inc.

Chapter Chapter 12 in Introduction to Incompleteness, 2024, pp 237-273 from Springer

Abstract: Abstract In his famous 1900 speech, Hilbert listed the 23 most significant open mathematical problems of his day, and CH held the number one spot. It took two major breakthroughs to find the answer: first, in 1939, Gödel proved that CH is consistent with set theory. Then, in 1963, Cohen proved that “not CH” is also consistent. Cohen developed a powerful new tool, called forcing, to prove this result.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-64217-3_12

Ordering information: This item can be ordered from
http://www.springer.com/9783031642173

DOI: 10.1007/978-3-031-64217-3_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().