| 000 | 00319nam a2200133Ia 4500 | ||
|---|---|---|---|
| 999 |
_c184952 _d184952 |
||
| 020 | _a0387901701 | ||
| 040 | _cCUS | ||
| 082 |
_a511.3 _bMON/M |
||
| 100 | _aMonk,James Donald | ||
| 245 | 0 |
_aMathematical logic/ _cJames Donald Monk |
|
| 260 |
_aNew York : _bSpringer, _c1976. |
||
| 300 |
_ax,531p. : _c24 cm. |
||
| 504 | _aIncludes index. | ||
| 505 | _aInterdependence of sections.- I Recursive Function Theory.- I. Turing machines.- 2. Elementary recursive and primitive recursive functions.- 3. Recursive functions; Turing computability.- 4. Markov algorithms.- 5. Recursion theory.- 6. Recursively enumerable sets.- 7. Survey of recursion theory.- II Elements of Logic.- 8. Sentential logic.- 9. Boolean algebra.- 10. Syntactics of first-order languages.- 11. Some basic results of first-order logic.- 12. Cylindric algebras.- III Decidable and Undecidable Theories.- 13. Some decidable theories.- 14. Implicit definability in number theories.- 15. General theory of undecidability.- 16. Some undecidable theories.- 17. Unprovability of consistency.- IV Model Theory.- 18. Construction of models.- 19. Elementary equivalence.- 20. Nonstandard mathematics.- 21. Complete theories.- 22. The interpolation theorem.- 23. Generalized products.- 24. Equational logic.- 25. Preservation and characterization theorems.- 26. Elementary classes and elementary equivalence.- 27. Types.- 28. Saturated structures.- V Unusual Logics.- 29. Inessential variations.- 30. Finitary extensions.- 31. Infinitary extensions.- | ||
| 650 | _aSymbolic and mathematical logic. | ||
| 650 | _aMathematical logic. | ||
| 942 | _cWB16 | ||