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

Available for the first time in 20 years, here is the Rudolf Carnap's famous principle of tolerance by which everyone is free to mix and match the rules of ...

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.

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

In recent years, several formalisms for program construction have appeared. One such formalism is the type theory developed by Per Martin-L f. Well suited as a theory for program construction, it makes possible the expression of both specifications and programs within the same formalism. Furthermore, the proof rules can be used to derive a correct program from a specification as well as to verify that a given program has a certain property. This book contains a thorough introduction to type theory, (...) with information on polymorphic sets, subsets, monomorphic sets, and a full set of helpful examples. (shrink)

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

Multiple -conclusion logic extends formal logic by allowing arguments to have a set of conclusions instead of a single one, the truth lying somewhere among the conclusions if all the premises are true. The extension opens up interesting possibilities based on the symmetry between premises and conclusions, and can also be used to throw fresh light on the conventional logic and its limitations. This is a sustained study of the subject and is certain to stimulate further research. Part I reworks (...) the fundamental ideas of logic to take account of multiple conclusions, and investigates the connections between multiple - and single - conclusion calculi. Part II draws on graph theory to discuss the form and validity of arguments independently of particular logical systems. Part III contrasts the multiple - and the single - conclusion treatment of one and the same subject, using many-valued logic as the example; and Part IV shows how the methods of 'natural deduction' can be matched by direct proofs using multiple conclusions. (shrink)

Over the last few decades Michael Dummett developed a rich program for assessing logic and the meaning of the terms of a language. He is also a major exponent of Frege's version of logicism in the philosophy of mathematics. Over the last decade, Neil Tennant developed an extensive version of logicism in Dummettian terms, and Dummett influenced other contemporary logicists such as Crispin Wright and Bob Hale. The purpose of this paper is to explore the prospects for Fregean logicism within (...) a broadly Dummettian framework. The conclusions are mostly negative: Dummett's views on analyticity and the logical/non-logical boundary leave little room for logicism. Dummett's considerations concerning manifestation and separability lead to a conservative extension requirement: if a sentence S is logically true, then there is a proof of S which uses only the introduction and elimination rules of the logical terms that occur in S. If basic arithmetic propositions are logically true-as the logicist contends-then there is tension between this conservation requirement and the ontological commitments of arithmetic. It follows from Dummett's manifestation requirements that if a sentence S is composed entirely of logical terminology, then there is a formal deductive system D such that S is analytic, or logically true, if and only if S is a theorem of D. There is a deep conflict between this result and the essential incompleteness, or as Dummett puts it, the indefinite extensibility, of arithmetic truth. (shrink)

Peirce's example puts another nail in the coffin of the truth-functionality thesis. Conditionals are not truth-functional.

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

The validity of argument by disjunctive syllogism has been denied by proponents of relevant and paraconsistent logic. DS is stigmatised for its role in inferences — most notably C.I. Lewis's derivation of that fallacy of irrelevance ex falso quodlibet — that involve both it and other rules of inference governing disjunction, or, to speak more precisely, other rules of inference taken to apply to the very same disjunction that obeys DS. In avoiding these inferences the road less travelled is to (...) deny the identity rather than to deny DS: what follows is, then, an exercise in disjoining disjunctions. (shrink)

Such a conception, says Dummett, will form "a base camp for an assault on the metaphysical peaks: I have no greater ambition in this book than to set up a base ...