Mathematical Logic and Computation

Inbunden, Engelska, 2022

851 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2022-11-24
Mått:182 x 263 x 28 mm
Vikt:1 180 g
Format:Inbunden
Språk:Engelska
Antal sidor:526
Förlag:Cambridge University Press
ISBN:9781108478755

Utforska kategorier

Mer om författaren

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.

Recensioner i media

'Avigad provides a much needed introduction to mathematical logic that foregrounds the role of syntax and computability in our understanding of consistency and inconsistency. The result provides a jumping off point to any of the fields of modern logic, not only teaching the technical groundwork, but also providing a window into how to think like a logician.' Henry Towsner, University of Pennsylvania

Innehållsförteckning

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.