Set theory : an introduction to independence proofs
Author(s)
Bibliographic Information
Set theory : an introduction to independence proofs
（Studies in logic and the foundations of mathematics, v. 102）
North-Holland Pub. Co , Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1980
- : hard
- : [soft]
Available at / 90 libraries
-
Science and Technology Library, Kyushu University
410.9/Ku 41068252191007777,
: hard068222181024346 -
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: hardKUN||5||12693878
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
dc19:510.3/k9622021156712
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. 305-308
Includes indexes
Description and Table of Contents
Description
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 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.
Table of Contents
The Foundations of Set Theory. Infinitary Combinatorics. The Well-Founded Sets. Easy Consistency Proofs. Defining Definability. The Constructible Sets. Forcing. Iterated Forcing. Bibliography. Indexes.
by "Nielsen BookData"