This book is intended to be used as a textbook by students of mathematics, and also within limitations as a reference work.

This book is intended to be used as a textbook by students of mathematics, and also within limitations as a reference work.

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)

I ON THE PRIMITIVE TERM OF LOGISTICf IN this article I propose to establish a theorem belonging to logistic concerning some connexions, not widely known, ...

Fascinating study of the origin and nature of mathematical thought, including relation of mathematics and science, 20th-century developments, impact of computers, and more.Includes 34 illustrations. 1968 edition.".

The fundamental texts of the great classical period in modern logic, some of them never before available in English translation, are here gathered together for ...

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

A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...) coverage of introductory material such as sets. Increased flexibility of the text, allowing instructors more choice in how they use the textbook in courses. Reduced mathematical rigour to fit the needs of undergraduate students. (shrink)

For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...) is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are definitionally equivalent with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories. (shrink)

One innovation in this paper is its identification, analysis, and description of a troubling ambiguity in the word ‘argument’. In one sense ‘argument’ denotes a premise-conclusion argument: a two-part system composed of a set of sentences—the premises—and a single sentence—the conclusion. In another sense it denotes a premise-conclusion-mediation argument—later called an argumentation: a three-part system composed of a set of sentences—the premises—a single sentence—the conclusion—and complex of sentences—the mediation. The latter is often intended to show that the conclusion follows from (...) the premises. The complementarity and interrelation of premise-conclusion arguments and premise-conclusion-mediation arguments resonate throughout the rest of the paper which articulates the conceptual structure found in logic from Aristotle to Tarski. This 1972 paper can be seen as anticipating Corcoran’s signature work: the more widely read 1989 paper, Argumentations and Logic, Argumentation 3, 17–43. MR91b:03006. The 1972 paper was translated into Portuguese. The 1989 paper was translated into Spanish, Portuguese, and Persian. (shrink)

§30. Significance of Desargues's theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 CHAPTER VI. PASCAL'S THEOREM. §31. ...