Set Theory An Introduction To Independence Proofs
- 1st Edition, Volume 102 - December 1, 1983
- Imprint: North Holland
- Author: K. Kunen
- Language: English
- Paperback ISBN:9 7 8 - 0 - 4 4 4 - 5 6 4 0 2 - 3
- Hardback ISBN:9 7 8 - 0 - 4 4 4 - 8 6 8 3 9 - 8
- eBook ISBN:9 7 8 - 0 - 0 8 - 0 5 7 0 5 8 - 7
Studies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Independence Proofs offers an introduction to relative consistency proofs in… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteStudies in Logic and the Foundations of Mathematics, Volume 102: Set Theory: An Introduction to Independence Proofs offers an introduction to relative consistency proofs in axiomatic set theory, including combinatorics, sets, trees, and forcing. The book first tackles the foundations of set theory and infinitary combinatorics. Discussions focus on the Suslin problem, Martin's axiom, almost disjoint and quasi-disjoint sets, trees, extensionality and comprehension, relations, functions, and well-ordering, ordinals, cardinals, and real numbers. The manuscript then ponders on well-founded sets and easy consistency proofs, including relativization, absoluteness, reflection theorems, properties of well-founded sets, and induction and recursion on well-founded relations. The publication examines constructible sets, forcing, and iterated forcing. Topics include Easton forcing, general iterated forcing, Cohen model, forcing with partial functions of larger cardinality, forcing with finite partial functions, and general extensions. The manuscript is a dependable source of information for mathematicians and researchers interested in set theory.
The Foundations of Set Theory. Infinitary Combinatorics. The Well-Founded Sets. Easy Consistency Proofs. Defining Definability. The Constructible Sets. Forcing. Iterated Forcing. Bibliography. Indexes.
- Edition: 1
- Volume: 102
- Published: December 1, 1983
- Imprint: North Holland
- No. of pages: 330
- Language: English
- Paperback ISBN: 9780444564023
- Hardback ISBN: 9780444868398
- eBook ISBN: 9780080570587