An anthology of fundamental papers on undecidability and unsolvability, this classic reference opens with Gödel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Gödel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition. Slightly corrected republication of the edition published by Raven Press Books, Ltd., Hewlett, New York, 1965.
Mathematical Logic by Stephen Cole Kleene Contents include an elementary but thorough overview of mathematical logic of 1st order; formal number theory; surveys of the work by Church, Turing, and others, including Gödel's completeness theorem, Gentzen's theorem, more.
The Philosophy of Mathematics: An Introductory Essay by Stephan Körner A distinguished philosopher surveys the mathematical views and influence of Plato, Aristotle, Leibniz, and Kant. He also examines the relationship between mathematical theories, empirical data, and philosophical presuppositions. 1968 edition.
Logic for Mathematicians by J. Barkley Rosser Examination of essential topics and theorems assumes no background in logic. "Undoubtedly a major addition to the literature of mathematical logic." — Bulletin of the American Mathematical Society. 1978 edition.
Real Computing Made Real: Preventing Errors in Scientific and Engineering Calculations by Forman S. Acton This concise guide to trouble-shooting offers practical advice on detecting and removing the bugs, preserving significant figures, avoiding extraneous solutions, and finding efficient iterative processes for solving nonlinear equations. 1996 edition.
