A Course in Mathematical Logic for Mathematicians1. The ?rst edition of this book was published in 1977. The text has been well received and is still used, although it has been out of print for some time. In the intervening three decades, a lot of interesting things have happened to mathematical logic: (i) Model theory has shown that insights acquired in the study of formal languages could be used fruitfully in solving old problems of conventional mathematics. (ii) Mathematics has been and is moving with growing acceleration from the set-theoretic language of structures to the language and intuition of (higher) categories, leaving behind old concerns about in?nities: a new view of foundations is now emerging. (iii) Computer science, a no-nonsense child of the abstract computability theory, has been creatively dealing with old challenges and providing new ones, such as the P/NP problem. Planning additional chapters for this second edition, I have decided to focus onmodeltheory,the conspicuousabsenceofwhichinthe ?rsteditionwasnoted in several reviews, and the theory of computation, including its categorical and quantum aspects. The whole Part IV: Model Theory, is new. I am very grateful to Boris I. Zilber, who kindly agreed to write it. It may be read directly after Chapter II. The contents of the ?rst edition are basically reproduced here as Chapters I–VIII. Section IV.7, on the cardinality of the continuum, is completed by Section IV.7.3, discussing H. Woodin’s discovery. |
Contents
| 3 | |
| 19 | |
8739_2_En_3_Chapter_OnlinePDFpdf | 104 |
8739_2_En_4_Chapter_OnlinePDFpdf | 151 |
8739_2_En_2_Part_OnlinePDFpdf | 176 |
8739_2_En_5_Chapter_OnlinePDFpdf | 177 |
8739_2_En_6_Chapter_OnlinePDFpdf | 207 |
8739_2_En_3_Part_OnlinePDFpdf | 232 |
8739_2_En_7_Chapter_OnlinePDFpdf | 233 |
8739_2_En_8_Chapter_OnlinePDFpdf | 263 |
8739_2_En_9_Chapter_OnlinePDFpdf | 285 |
8739_2_En_4_Part_OnlinePDFpdf | 328 |
8739_2_En_10_Chapter_OnlinePDFpdf | 331 |
8739_2_En_BookBackmatter_OnlinePDFpdf | 378 |
Other editions - View all
Common terms and phrases
1-level algebraically closed algorithm alphabet arithmetic atomic formulas axiom of choice axioms basic bijection Boolean algebra Boolean circuit cardinality Chapter closed with respect complete computable consider consists constructive world continuum hypothesis corresponding countable deduction defined definition denote Diophantine Diophantine sets elements embedding enumerable sets equivalent example exists expression fact find finite first formal function f Gödel’s graph Hence induction infinite integers interpretation intuitive isomorphism L-structures L-true L1Ar L1Set language Lemma limit ordinal logic mathematics model theory morphisms notation obtain operations partial function partial recursive polynomial pregeometry primitive recursive primitive recursive function projection proof Proposition prove quantifier quantum recursive function relations semicomputable sequence set of formulas strongly minimal structure subgroup subset symbols tautologies theorem true truth unique values verify von Neumann universe Z+)m Z+)n