5. Computational Line Geometry by Pottmann and Wallner. Books on Cryptography 1. Data Privacy and Security by David Salomon. 2. Block Error-Correcting Codes: A Computational Primer by Xambo-Descamps. Misc Books 1. Veri cation of Reactive Systems: Formal Methods and Algorithms by Schneider. 2. Information Theory, Inference, and Learning Algorithms by MacKay. 3. Finite Automata by Lawson. 4. Logic for Learning by Lloyd. 5. Combinatorial Designs: Constructions and Analysis by Stinson. 6. Selected Papers on Discrete Math by Donald Knuth. Review2 of The Classical Decision Problem Authors: Egon B rger, Erich Gr del and Yuri Gurevich o a Series: Universitext Springer-Verlag, 1997 Second printing, 2001 Softcover, x + 482 pages Reviewer: Dan A. Simovici, (dsim@cs.umb.edu) Overview This book is dedicated to a comprehensive presentation of the classical decision problem of rstorder logic. The centrality of the original decision problem (which can be stated equivalently as the satis ability problem for formulas, the validity problem for sentences, or the provability of formulas in a sound and complete formal system) has been identi ed by the founders of mathematical logic. Subsequent developments in mathematical logic and theoretical computer science, especially the formalization of the notion of computable function by G del,
/lp/association-for-computing-machinery/review-of-the-classical-decision-problem-by-egon-b-rger-erich-gr-del-5CqjfyuuJC