Problems and Theorems in Classical Set Theory / (Record no. 43958)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04161nam a22002057a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | CUTN |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250124121250.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250124b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781071603710 |
| 041 ## - LANGUAGE CODE | |
| Language | English |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.322 |
| Item number | KOM |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Komjáth, Peter |
| 245 ## - TITLE STATEMENT | |
| Title | Problems and Theorems in Classical Set Theory / |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Name of publisher, distributor, etc | Springer, |
| Date of publication, distribution, etc | 2006. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 516p.: |
| Other physical details | ill.; |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Title | Front Matter<br/>Pages 1-1<br/>Operations on sets<br/>Pages 3-7<br/>Countability<br/>Pages 9-12<br/>Equivalence<br/>Pages 13-14<br/>Continuum<br/>Pages 15-18<br/>Sets of reals and real functions<br/>Pages 19-21<br/>Ordered sets<br/>Pages 23-31<br/>Order types<br/>Pages 33-36<br/>Ordinals<br/>Pages 37-41<br/>Ordinal arithmetic<br/>Pages 43-50<br/>Cardinals<br/>Pages 51-54<br/>Partially ordered sets<br/>Pages 55-57<br/>Transfinite enumeration<br/>Pages 59-61<br/>Euclidean spaces<br/>Pages 63-64<br/>Zorn’s lemma<br/>Pages 65-66<br/>Hamel bases<br/>Pages 67-69<br/>The continuum hypothesis<br/>Pages 71-73<br/>Ultrafilters on ω<br/>Pages 75-78<br/>Families of sets<br/>Pages 79-80<br/>The Banach-Tarski paradox<br/>Pages 81-83<br/>Stationary sets in ω1<br/>Pages 85-87<br/>Stationary sets in larger cardinals<br/>Pages 89-92<br/>Canonical functions<br/>Pages 93-94<br/>Infinite graphs<br/>Pages 95-99<br/>Partition relations<br/>Pages 101-105<br/>Δ-systems<br/>Pages 107-108<br/>Set mappings<br/>Pages 109-110<br/>Trees<br/>Pages 111-115<br/>The measure problem<br/>Pages 117-121<br/>Stationary sets in [λ]<κ<br/>Pages 123-125<br/>The axiom of choice<br/>Pages 127-128<br/>Well-founded sets and the axiom of foundation<br/>Pages 129-132<br/>Solutions<br/>Front Matter<br/>Pages 133-133<br/><br/>Operations on sets<br/>Pages 135-146<br/>Countability<br/>Pages 147-157<br/>Equivalence<br/>Pages 159-162<br/>Continuum<br/>Pages 163-172<br/>Sets of reals and real functions<br/>Pages 173-183<br/>Ordered sets<br/>Pages 185-212<br/>Order types<br/>Pages 213-222<br/>Ordinals<br/>Pages 223-235<br/>Ordinal arithmetic<br/>Pages 237-263<br/>Cardinals<br/>Pages 265-273<br/>Partially ordered sets<br/>Pages 275-284<br/>Transfinite enumeration<br/>Pages 285-297<br/>Euclidean spaces<br/>Pages 299-307<br/>Zorn’s lemma<br/>Pages 309-316<br/>Hamel bases<br/>Pages 317-326<br/>The continuum hypothesis<br/>Pages 327-339<br/>Ultrafilters on ω<br/>Pages 341-349<br/>Families of sets<br/>Pages 351-357<br/>The Banach-Tarski paradox<br/>Pages 359-368<br/>Stationary sets in ω1<br/>Pages 369-376<br/>Stationary sets in larger cardinals<br/>Pages 377-383<br/>Canonical functions<br/>Pages 385-387<br/>Infinite graphs<br/>Pages 389-403<br/>Partition relations<br/>Pages 405-420<br/>Δ-systems<br/>Pages 421-425<br/>Set mappings<br/>Pages 427-432<br/>Trees<br/>Pages 433-451<br/>The measure problem<br/>Pages 453-462<br/>Stationary sets in [λ]<κ<br/>Pages 463-470<br/>The axiom of choice<br/>Pages 471-479<br/>Well-founded sets and the axiom of foundation<br/>Pages 481-489<br/>Back Matter<br/>Pages 491-516 |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Although the ?rst decades of the 20th century saw some strong debates on set theory and the foundation of mathematics, afterwards set theory has turned into a solid branch of mathematics, indeed, so solid, that it serves as the foundation of the whole building of mathematics. Later generations, honest to Hilbert’s dictum, “No one can chase us out of the paradise that Cantor has created for us” proved countless deep and interesting theorems and also applied the methods of set theory to various problems in algebra, topology, in?nitary combinatorics, and real analysis. The invention of forcing produced a powerful, technically sophisticated tool for solving unsolvable problems. Still, most results of the pre-Cohen era can be digested with just the knowledge of a commonsense introduction to the topic. And it is a worthy e?ort, here we refer not just to usefulness, but, ?rst and foremost, to mathematical beauty. In this volume we o?er a collection of various problems in set theory. Most of classical set theory is covered, classical in the sense that independence methods are not used, but classical also in the sense that most results come fromtheperiod,say,1920–1970.Manyproblemsarealsorelatedtoother?elds of mathematics such as algebra, combinatorics, topology, and real analysis. We do not concentrate on the axiomatic framework, although some - pects, such as the axiom of foundation or the role ˆ of the axiom of choice, are elaborated.<br/> |
| 690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN) | |
| Department Name | Mathematics |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Project book |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Location | Date of Cataloging | Total Checkouts | Full call number | Barcode | Checked out | Date last seen | Date checked out | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Non-fiction | CUTN Central Library | CUTN Central Library | 24/01/2025 | 1 | 511.322 KOM | 51937 | 21/02/2025 | 24/01/2025 | 24/01/2025 | 24/01/2025 | Project book |