Handbook of Mathematical LogicJ. Barwise Elsevier, 1 במרץ 1982 - 1164 עמודים The handbook is divided into four parts: model theory, set theory, recursion theory and proof theory. Each of the four parts begins with a short guide to the chapters that follow. Each chapter is written for non-specialists in the field in question. Mathematicians will find that this book provides them with a unique opportunity to apprise themselves of developments in areas other than their own. |
תוכן
Set Theory | 315 |
Recursion Theory | 523 |
Proof Theory And Constructive Mathematics Guide To Part D | 817 |
| 1143 | |
| 1151 | |
מהדורות אחרות - הצג הכל
מונחים וביטויים נפוצים
admissible algebraic applications argument arithmetic assume axiom of choice axioms basic called cardinal Chapter closed coding compact complete computation consider consistent construction contains Corollary countable decidable defined definition denote derivation discussed effective elementary elements enumerable equivalent example exists extension fact fields finite first-order forcing formal formula function give given hence holds implies induction infinite interpretation Kleene language least LEMMA length limit logic Math mathematics means method natural Note notion numbers objects obtained operator ordinal partial particular present principle problem proof properties propositional prove quantifiers recursion theory recursive recursive functions regular relation result rule satisfies sentences sequence set theory space structure subset Suppose symbols theorem tree true universal variables write