The book would not replace textbooks (such as Soare or Odifreddi) as graduate introduction t o computability theory . Only techniques and result related to bounded queries are really discusse d in this book . The book does not give the necessary background needed to do heavy duty research in computability theory. Review of Logic For Applications 4 Second Edition, 199 7 Authors : Anil Nerode, Richard A . Shor e Publisher : Springer Verla g Hardcover $49 .95 ISBN 038794893 7 456 Pages Reviewer: Alexander Dekhtyar Department of Computer Scienc e University of Marylan d at College Par k dekhtyar@cs . umd .ed u 1 Overview Among the books on foundations of mathematics and theoretical computer science, textbooks o n logic and logic programming are usually quite distinct . The former introduce propositional and predicate logic, study their properties and prove the soundness and completeness results togethe r with some more advanced results, such as the NP-completeness of the satisfiability problem fo r propositional case and undecidability of this problem for first order logic . The proof system s discussed in these books are usually either Hilbert- or Gentzen-style . The latter category of th e textbooks
/lp/association-for-computing-machinery/book-review-logic-for-applications-second-edition-by-anil-nerode-and-oIFEzkXRQR