First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. Introduction by R. B. Braithwaite.
Computability and Unsolvability by Martin Davis Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more.
First-Order Logic by Raymond M. Smullyan This self-contained study is both an introduction to quantification theory and an exposition of new results and techniques in "analytic" or "cut free" methods. The focus is on the tableau point of view. Includes 144 illustrations.
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.
