A Course in Mathematical LogicElsevier, 1 jan 1977 - 620 pagina's A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included. |
Inhoudsopgave
| 1 | |
| 5 | |
Chapter 2 FirstOrder Logic | 49 |
Chapter 3 FirstOrder Logic Continued | 108 |
Chapter 4 Boolean Algebras | 125 |
Chapter 5 Model Theory | 161 |
Chapter 6 Recursion Theory | 226 |
Chapter 7 Logic Limitative Results | 316 |
Chapter 8 Recursion Theory Continued | 361 |
Chapter 9 Intuitionistic FirstOrder Logic | 400 |
Chapter 10 Axiomatic Set Theory | 459 |
Chapter 11 Nonstandard Analysis | 531 |
| 576 | |
| 585 | |
| 595 | |
Overige edities - Alles bekijken
Veelvoorkomende woorden en zinsdelen
algorithmic apply arithmetical assume atomic axiom belongs Boolean algebra Boolean space branch cardinality clearly clopen Compactness Theorem computable confutation consistent construct countable deduction Deduction Theorem defined definition denote diophantine elementary equivalent existential quantification extension extralogical filter finite set first-order language follows free variables function symbols functional F given hence homomorphism identity inconsistent induction hypothesis infinite interpolant intuitionistic isomorphic L-formula L-structure L-terms Lemma logic mapping mathematical MRDP Theorem n-ary function n-tuple natural numbers node non-empty nonstandard nonstandard analysis obtained occur one-one operation ordinal postulates predicate calculus predicate symbol Prob PROBLEM proof of Thm propositional prove quantifier r.e. set recursion theory recursive function result rules satisfying sentence sequence set of formulas set of L-sentences Show structure Subcase Suppose T₁ T₂ tableau term topology truth valuation ultrafilter unary universal quantification URIM