Cantitate/Preț
Produs

Mathematical Logic: Graduate Texts in Mathematics, cartea 37

Autor J. D. Monk
en Limba Engleză Hardback – 7 sep 1976
From the Introduction: "We shall base our discussion on a set-theoretical foundation like that used in developing analysis, or algebra, or topology. We may consider our task as that of giving a mathematical analysis of the basic concepts of logic and mathematics themselves. Thus we treat mathematical and logical practice as given empirical data and attempt to develop a purely mathematical theory of logic abstracted from these data."
There are 31 chapters in 5 parts and approximately 320 exercises marked by difficulty and whether or not they are necessary for further work in the book.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 59604 lei  6-8 săpt.
  Springer – 15 iul 2012 59604 lei  6-8 săpt.
Hardback (1) 60275 lei  6-8 săpt.
  Springer – 7 sep 1976 60275 lei  6-8 săpt.

Din seria Graduate Texts in Mathematics

Preț: 60275 lei

Preț vechi: 70912 lei
-15% Nou

Puncte Express: 904

Preț estimativ în valută:
11535 11951$ 9627£

Carte tipărită la comandă

Livrare economică 22 martie-05 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387901701
ISBN-10: 0387901701
Pagini: 532
Ilustrații: X, 532 p.
Dimensiuni: 156 x 234 x 30 mm
Greutate: 0.94 kg
Ediția:1976
Editura: Springer
Colecția Springer
Seria Graduate Texts in Mathematics

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

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.- Index of symbols.- Index of names and definitions.