Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

This is a book that no one but Weyl could have written--and, indeed, no one has written anything quite like it since.

Karl Raimund Poppers (1902-1994) Hauptwerk, die Logik der Forschung (1934), gilt als Grundlagenwerk des kritischen Rationalismus. Der kritische Rationalismus zeigt, warum unser Wissen fehlbar ist und versteht den Erkenntnisfortschritt als Resultat von Hypothesenbildung und -widerlegung. Der Sammelband orientiert sich an der Gliederung der Logik der Forschung. Seine Beiträge kommentieren die jeweiligen Themen nach aktueller Forschungslage.

This is an extensively revised edition of Mr. Quine's introduction to abstract set theory and to various axiomatic systematizations of the subject.

Comprehensive account of constructive theory of first-order predicate calculus. Covers formal methods including algorithms and epi-theory, brief treatment of Markov’s approach to algorithms, elementary facts about lattices and similar algebraic systems, more. Philosophical and reflective as well as mathematical. Graduate-level course. 1963 ed. Exercises.

This is an extensively revised edition of Mr. Quine's introduction to abstract set theory and to various axiomatic systematizations of the subject. The treatment of ordinal numbers has been strengthened and much simplified, especially in the theory of transfinite recursions, by adding an axiom and reworking the proofs. Infinite cardinals are treated anew in clearer and fuller terms than before. Improvements have been made all through the book; in various instances a proof has been shortened, a theorem strengthened, a space-saving (...) lemma inserted, an obscurity clarified, an error corrected, a historical omission supplied, or a new event noted. (shrink)

Hailed by the Bulletin of the American Mathematical Society as "undoubtedly a major addition to the literature of mathematical logic," this volume examines the essential topics and theorems of mathematical reasoning. No background in logic is assumed, and the examples are chosen from a variety of mathematical fields. Starting with an introduction to symbolic logic, the first eight chapters develop logic through the restricted predicate calculus. Topics include the statement calculus, the use of names, an axiomatic treatment of the statement (...) calculus, descriptions, and equality. Succeeding chapters explore abstract set theory—with examinations of class membership as well as relations and functions—cardinal and ordinal arithmetic, and the axiom of choice. An invaluable reference book for all mathematicians, this text is suitable for advanced undergraduates and graduate students. Numerous exercises make it particularly appropriate for classroom use. (shrink)

Reprint of the original, first published in 1860.

In the mathematical documents which have come down to us from these peoples, there are no theorems or demonstrations, and the fundamental concepts of ...

In his doctor's thesis [1], Henkin has shown that if a formal logic is consistent, and sufficiently complex, then it must admit a non-standard model. In particular, he showed that there must be a model in which that portion of the model which is supposed to represent the positive integers of the formal logic is not in fact isomorphic to the positive integers; indeed it is not even well ordered by what is supposed to be the relation of ≦.For the (...) purposes of the present paper, we do not need a precise definition of what is meant by a standard model of a formal logic. The non-standard models which we shall discuss will be flagrantly non-standard, as for instance a model of the sort whose existence is proved by Henkin. It will suffice if we and our readers are in agreement that a model of a formal logic is not a standard model if either: The relation in the model which represents the equality relation in the formal logic is not the equality relation for objects of the model. That portion of the model which is supposed to represent the positive integers of the formal logic is not well ordered by the relation ≦. That portion of the model which is supposed to represent the ordinal numbers of the formal logic is not well ordered by the relation ≦. (shrink)