Torrent details for "Halbeisen L. Combinatorial Set Theory. With a Gentle Introductio…" Log in to bookmark
Controls:
×
Report Torrent
Please select a reason for reporting this torrent:
Your report will be reviewed by our moderation team.
×
Report Information
Loading report information...
This torrent has been reported 0 times.
Report Summary:
| User | Reason | Date |
|---|
Failed to load report information.
×
Success
Your report has been submitted successfully.
Checked by:
Category:
Language:
None
Total Size:
9.9 MB
Info Hash:
39A3CE0E626E26AC8C3DC67CC21E61323E63042F
Added By:
Added:
June 23, 2025, 4:36 p.m.
Stats:
|
(Last updated: June 23, 2025, 4:38 p.m.)
| File | Size |
|---|---|
| ['Halbeisen L. Combinatorial Set Theory. With a Gentle Introduction...3ed 2025.pdf'] | 0 bytes |
Name
DL
Uploader
Size
S/L
Added
NOTE
SOURCE: Halbeisen L. Combinatorial Set Theory. With a Gentle Introduction...3ed 2025
-----------------------------------------------------------------------------------
COVER
-----------------------------------------------------------------------------------
MEDIAINFO
Textbook in PDF format After an overview of basic notions in combinatorics and first-order logic, and discussing in great detail the axioms of set theory, the author outlines in the second part the main topics of classical set theory, including Ramsey theory and the axiom of choice. As an application of the axiom of choice, a complete proof of Robinson's construction for doubling a ball by dividing it into only five parts is given. For the new edition, the chapter on permutation models has been extended, and recent results in set theory without the axiom of choice and about cardinal characteristics have been added. The third part explains the sophisticated technique of forcing from scratch, now including more details about iterated forcing. The technique is then used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In particular, it is shown that both Martin's Axiom and Suslin's Hypothesis are independent of the axioms of set theory. The final part, with a new chapter on Laver forcing, is mainly concerned with consistency results obtained by iterations of forcing notions such as Cohen forcing, Sacks forcing, and Mathias forcing. The part begins with an extended chapter on countable support iterations of proper forcing notions, now also including proofs of some preservation theorems such as preservation of properness and of certain ultrafilters. In the following chapters, various consistency results concerning possible relations between cardinal characteristics and the existence of Ramsey ultrafilters are presented. For example, a detailed proof of Shelah’s astonishing construction of a model with finitely many Ramsey ultrafilters is given
×