TY  - BOOK
AU  - Monk,J.Donald
TI  - Mathematical logic
SN  - 9780387901701
U1  - 511.3 
PY  - 1976///
CY  - New York
PB  - Springer-Verlag
KW  - Logic, Symbolic and mathematical
N1  - Includes bibliographies and indexes; - 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
UR  - http://www.loc.gov/catdir/enhancements/fy0905/75042416-d.html
UR  - http://www.loc.gov/catdir/enhancements/fy0905/75042416-t.html
ER  -