Mathematical Logic and Computation - Jeremy Avigad

Mathematical Logic and Computation

(Autor)

Buch | Hardcover
450 Seiten
2022
Cambridge University Press (Verlag)
978-1-108-47875-5 (ISBN)
74,80 inkl. MwSt
This book presents mathematical logic from the syntactic point of view, with an emphasis on aspects that are fundamental to computer science. It is an excellent introduction for graduate students and advanced undergraduates interested in logic in mathematics, computer science, and philosophy, and an invaluable reference for professional logicians.
This new book on mathematical logic by Jeremy Avigad gives a thorough introduction to the fundamental results and methods of the subject from the syntactic point of view, emphasizing logic as the study of formal languages and systems and their proper use. Topics include proof theory, model theory, the theory of computability, and axiomatic foundations, with special emphasis given to aspects of mathematical logic that are fundamental to computer science, including deductive systems, constructive logic, the simply typed lambda calculus, and type-theoretic foundations. Clear and engaging, with plentiful examples and exercises, it is an excellent introduction to the subject for graduate students and advanced undergraduates who are interested in logic in mathematics, computer science, and philosophy, and an invaluable reference for any practicing logician's bookshelf.

Jeremy Avigad is Professor in the Department of Philosophy and the Department of Mathematical Sciences at Carnegie Mellon University. His research interests include mathematical logic, formal verification, automated reasoning, and the philosophy and history of mathematics. He is the Director of the Charles C. Hoskinson Center for Formal Mathematics at Carnegie Mellon University.

Preface; 1. Fundamentals; 2. Propositional Logic; 3. Semantics of Propositional Logic; 4. First-Order Logic; 5. Semantics of First-Order Logic; 6. Cut Elimination; 7. Properties of First-Order Logic; 8. Primitive Recursion; 9. Primitive Recursive Arithmetic; 10. First-Order Arithmetic; 11. Computability 12. Undecidability and Incompleteness; 13. Finite Types; 14. Arithmetic and Computation; 15. Second-Order Logic and Arithmetic; 16. Subsystems of Second-Order Arithmetic; 17. Foundations; Appendix; References; Notation; Index.

Erscheinungsdatum
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Maße 182 x 263 mm
Gewicht 1180 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 1-108-47875-1 / 1108478751
ISBN-13 978-1-108-47875-5 / 9781108478755
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
37,99
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
25,00
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99