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, ...

A respected Harvard logician and philosopher gathers together twenty-nine writings dealing with the foundations of mathematics, Rudolf Carnap, lin-guistics, ...

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify (...) many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today. (shrink)

Of course we all know now that mathematics has proved that logic doesn't really make sense, but Etchemendy (philosophy, Stanford Univ.) goes further and challenges the received view of the conceptual underpinnings of modern logic by arguing that Tarski's model-theoretic analysis of logical consequences is wrong. He may have found the soft underbelly of the dead horse. Annotation copyrighted by Book News, Inc., Portland, OR.

In this manuscript, published here for the first time, Tarski explores the concept of logical notion. He draws on Klein's Erlanger Programm to locate the logical notions of ordinary geometry as those invariant under all transformations of space. Generalizing, he explicates the concept of logical notion of an arbitrary discipline.

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a (...) simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual. (shrink)

The present text book is intended as an introduction to elementary logic. Its content, structure, and manner have been determined in large measure - perhaps 'caused' is the better word- by certain desiderata about which the reader should be informed at the outset. The leading idea is that even an introductory treatment of logic may profitably be fashioned around a rigorous framework.

From the reviews: "A good textbook can improve a lecture course enormously, especially when the material of the lecture includes many technical details. Van Dalen's book, the success and popularity of which may be suspected from this steady interest in it, contains a thorough introduction to elementary classical logic in a relaxed way, suitable for mathematics students who just want to get to know logic. The presentation always points out the connections of logic to other parts of mathematics. The reader (...) immediately see the logic is "just another branch of mathematics" and not something more sacred." Acta Scientiarum Mathematicarum, Hungary. (shrink)

Some philosophers, notably Professors Quine and Geach, have stressed the analogies they see between pronouns of the vernacular and the bound variables of quantification theory. Geach, indeed, once maintained that ‘for a philosophical theory of reference, then, it is all one whether we consider bound variables or pronouns of the vernacular'. This slightly overstates Geach's positition since he recognizes that some pronouns of ordinary language do function differently from bound variables; he calls such pronouns ‘pronouns of laziness'. Geach's characterisation of (...) pronouns of laziness has varied from time to time, but the general idea should be clear from a paradigm example: A man who sometimes beats his wife has more sense than one who always gives in to her.The pronouns ‘one’ and ‘her’ go proxy for a noun or a noun phrase in the sense that the pronoun is replaceable in paraphrase by simple repetition of its antecedent. (shrink)

The standard approach to what I call “proof-theoretic semantics”, which is mainly due to Dummett and Prawitz, attempts to give a semantics of proofs by defining what counts as a valid proof. After a discussion of the general aims of proof-theoretic semantics, this paper investigates in detail various notions of proof-theoretic validity and offers certain improvements of the definitions given by Prawitz. Particular emphasis is placed on the relationship between semantic validity concepts and validity concepts used in normalization theory. It (...) is argued that these two sorts of concepts must be kept strictly apart. (shrink)

For 30 years, Quine, a dominant figure in logical theory and philosophy of logic, has combined insights in methodology, language, epistemology, and ontology, to blur the boundaries of speculative metaphysics and natural sciences. This revised text contains two new essays with replies from Quine.

In his 1936 paper,On the Concept of Logical Consequence, Tarski introduced the celebrated definition oflogical consequence: “The sentenceσfollows logicallyfrom the sentences of the class Γ if and only if every model of the class Γ is also a model of the sentenceσ.” [55, p. 417] This definition, Tarski said, is based on two very basic intuitions, “essential for the proper concept of consequence” [55, p. 415] and reflecting common linguistic usage: “Consider any class Γ of sentences and a sentence which (...) follows from the sentences of this class. From an intuitive standpoint it can never happen that both the class Γ consists only of true sentences and the sentenceσis false. Moreover, … we are concerned here with the concept of logical, i.e.,formal, consequence.” [55, p. 414] Tarski believed his definition of logical consequence captured the intuitive notion: “It seems to me that everyone who understands the content of the above definition must admit that it agrees quite well with common usage. … In particular, it can be proved, on the basis of this definition, that every consequence of true sentences must be true.” [55, p. 417] The formality of Tarskian consequences can also be proven. Tarski's definition of logical consequence had a key role in the development of the model-theoretic semantics of modern logic and has stayed at its center ever since. (shrink)

In the first section, I consider what several logicians say informally about the notion of logical consequence. There is significant variation among these accounts, they are sometimes poorly explained, and some of them are clearly at odds with the usual technical definition. In the second section, I first argue that a certain kind of informal account—one that includes elements of necessity, generality, and apriority—is approximately correct. Next I refine this account and consider several important questions about it, including the appropriate (...) characterization of necessity, the criterion for selecting logical constants, and the exact role of apriority. I argue, among other things, that there is no need to recognize a special logical sense of necessity and that the selection of terms to serve as logical constants is ultimately a pragmatic matter. In the third section, I consider whether the informal account I have presented and defended is adequately represented by the usual technical definition. I show that it is, and provably so, for certain limited ways of selecting logical constants. In the general case, however, there seems to be no way to be sure that the technical and informal accounts coincide. (shrink)

In recent work on Frege, one of the most salient issues has been whether he was prepared to make serious use of semantical notions such as reference and truth. I argue here Frege did make very serious use of semantical concepts. I argue, first, that Frege had reason to be interested in the question how the axioms and rules of his formal theory might be justified and, second, that he explicitly commits himself to offering a justification that appeals to the (...) notion of reference. I then discuss the justifications Frege offered, focusing on his discussion of inferences involving free variables, in section 17 of Grundgesetze, and his argument, in sections 29-32, that every well-formed expression of his formal language has a unique reference. (shrink)

Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...

In his 1936 paper,On the Concept of Logical Consequence, Tarski introduced the celebrated definition oflogical consequence: “The sentenceσfollows logicallyfrom the sentences of the class Γ if and only if every model of the class Γ is also a model of the sentenceσ.” [55, p. 417] This definition, Tarski said, is based on two very basic intuitions, “essential for the proper concept of consequence” [55, p. 415] and reflecting common linguistic usage: “Consider any class Γ of sentences and a sentence which (...) follows from the sentences of this class. From an intuitive standpoint it can never happen that both the class Γ consists only of true sentences and the sentenceσis false. Moreover, … we are concerned here with the concept of logical, i.e.,formal, consequence.” [55, p. 414] Tarski believed his definition of logical consequence captured the intuitive notion: “It seems to me that everyone who understands the content of the above definition must admit that it agrees quite well with common usage. … In particular, it can be proved, on the basis of this definition, that every consequence of true sentences must be true.” [55, p. 417] The formality of Tarskian consequences can also be proven. Tarski's definition of logical consequence had a key role in the development of the model-theoretic semantics of modern logic and has stayed at its center ever since. (shrink)

Thirty-two years ago W. V. Quine proposed a definition of 'logical truth' that has been widely repeated and reprinted. Quine himself seems to have recognized that this definition is wrong in detail; in section 1 we eliminate this fault. What has perhaps been less widely observed is that, in abandoning the model-theoretic account of logical truth in favor of a "substitutional" account, Quine's definition swells the ranks of the logical truths and makes the classification of a sentence as a logical (...) truth dependent both on the interpretation of its extralogical words and on the extralogical vocabulary available in the language. (shrink)

I consider the well-known criticism of Quine's characterization of first-order logical truth that it expands the class of logical truths beyond what is sanctioned by the model-theoretic account. Briefly, I argue that at best the criticism is shallow and can be answered with slight alterations in Quine's account. At worse the criticism is defective because, in part, it is based on a misrepresentation of Quine. This serves not only to clarify Quine's position, but also to crystallize what is and what (...) is not at issue in choosing the model-theoretic account of first-order logical truth over one in terms of substitutions. I conclude by highlighting the need for justifying the belief that the definition of first-order logical truth in terms of models is superior to its definition in terms of substitutions. (shrink)