<p/><br></br><p><b> About the Book </b></p></br></br>Comprehensive overview, suitable for advanced undergraduates and graduate students, covers propositional logic; first-order languages and logic; incompleteness, undecidability, and indefinability; recursive functions; computability; and Hilbert's Tenth Problem. 1995 edition.<p/><br></br><p><b> Book Synopsis </b></p></br></br>Widely praised for its clarity and thorough coverage, this comprehensive overview of mathematical logic is suitable for readers of many different backgrounds. Designed primarily for advanced undergraduates and graduate students of mathematics, the treatment also contains much of interest to advanced students in computer science and philosophy. <br>An introductory section prepares readers for successive chapters on propositional logic and first-order languages and logic. Subsequent chapters shift in emphasis from an approach to logic from a mathematical point of view to the interplay between mathematics and logic. Topics include the theorems of G�del, Church, and Tarski on incompleteness, undecidability, and indefinability; a rigorous treatment of recursive functions and recursive relations; computability theory; and Hilbert's Tenth Problem. Numerous exercises appear throughout the text, and an appendix offers helpful background on number theory.<p/><br></br><p><b> From the Back Cover </b></p></br></br>Widely praised for its clarity and thorough coverage, this comprehensive overview of mathematical logic is suitable for readers of many different backgrounds. Designed primarily for advanced undergraduates and graduate students of mathematics, the treatment also contains much of interest to advanced students in computer science and philosophy. <br>An introductory section prepares readers for successive chapters on propositional logic and first-order languages and logic. Subsequent chapters shift in emphasis from an approach to logic from a mathematical point of view to the interplay between mathematics and logic. Topics include the theorems of G�del, Church, and Tarski on incompleteness, undecidability, and indefinability; a rigorous treatment of recursive functions and recursive relations; computability theory; and Hilbert's Tenth Problem. Numerous exercises appear throughout the text, and an appendix offers helpful background on number theory.<br>Dover (2013) republication of the edition published by PWS Publishing Company, Boston, 1995.<br>See every Dover book in print at<br><b>www.doverpublications.com</b>
Cheapest price in the interval: 20.99 on November 8, 2021
Most expensive price in the interval: 23.99 on March 10, 2021
Price Archive shows prices from various stores, lets you see history and find the cheapest. There is no actual sale on the website. For all support, inquiry and suggestion messagescommunication@pricearchive.us