000 01015cam a2200277 i 4500
999 _c196673
_d196673
020 _a9780387901701
040 _cCUS
082 0 0 _a511.3
_bMON/M
100 1 _aMonk, J. Donald
245 1 0 _aMathematical logic /
_cJ. Donald Monk
260 _aNew York :
_bSpringer-Verlag,
_c1976.
300 _ax, 531 p.
_c25 cm.
440 0 _aGraduate texts in mathematics ;
_v37
504 _aIncludes bibliographies and indexes.
505 _a- 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.- Index of symbols.- Index of names and definitions
650 0 _aLogic, Symbolic and mathematical.
856 4 2 _uhttp://www.loc.gov/catdir/enhancements/fy0905/75042416-d.html
856 4 1 _uhttp://www.loc.gov/catdir/enhancements/fy0905/75042416-t.html
942 _cWB16