- Author:
- Jean H. Gallier
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving.Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.
Cited By
David V, Fournier-S'niehotta R and Travers N NeoMaPy: A Parametric Framework for Reasoning with MAP Inference on Temporal Markov Logic Networks Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, (400-409)- Ferenczi M (2022). On the algebraization of Henkin‐type second‐order logic, Mathematical Logic Quarterly, 68:2, (149-158), Online publication date: 19-Apr-2022.
- Bjørgen E, Madsen S, Bjørknes T, Heimsæter F, Håvik R, Linderud M, Longberg P, Dennis L and Slavkovik M Cake, Death, and Trolleys Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, (23-29)
- Makowsky J and Zamansky A (2017). Keeping logic in the trivium of computer science, Formal Methods in System Design, 51:2, (419-430), Online publication date: 1-Nov-2017.