Normal view MARC view ISBD view

Mathematical logic/ James Donald Monk

By: Monk,James DonaldMaterial type: Text

TextPublication details: New York : Springer, 1976Description: x,531p. : 24 cmISBN: 0387901701Subject(s): Symbolic and mathematical logic | Mathematical logicDDC classification: 511.3

Contents:

Interdependence 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.-

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
General Books	Central Library, Sikkim University General Book Section	511.3 MON/M (Browse shelf(Opens below))	Available		P39964

Total holds: 0

Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.3 KOZ/A Automata and Computability, Undergraduate Texts in Computer Science.	511.3 LEW/E Elements of the Theory of Computation,	511.3 MAN/C A course in mathematical logic for mathematicians/	511.3 MON/M Mathematical logic/	511.3 MOS/L Logic from Computer Science/	511.3 SRI/C A Course on Mathematical Logic/	511.3 TOU/M Mathematical logic/	Next

Includes index.

Interdependence 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.-

There are no comments on this title.

to post a comment.