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

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic (...) to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated. (shrink)

This book offers a unique synthesis of past and current work on the structure, meaning, and use of negation and negative expressions, a topic that has engaged thinkers from Aristotle and the Buddha to Freud and Chomsky. Horn's masterful study melds a review of scholarship in philosophy, psychology, and linguistics with original research, providing a full picture of negation in natural language and thought; this new edition adds a comprehensive preface and bibliography, surveying research since the book's original publication.

An Invitation to Formal Reasoning introduces the discipline of formal logic by means of a powerful new system formulated by Fred Sommers. This system, term logic, is different in a number of ways from the standard system employed in modern logic; most striking is its greater simplicity and naturalness. Based on a radically different theory of logical syntax than the one Frege used when initiating modern mathematical logic in the 19th Century, term logic borrows insights from Aristotle's syllogistic, Scholastic logicians, (...) Leibniz, and the 19th century British algebraists. Term logic takes its syntax directly from natural language, construing statements as combinations of pairs of terms, where complex terms are taken to have the same syntax as statements. Whereas standard logic requires extensive 'translation' from natural language to symbolic language, term logic requires only 'transcription' into the symbolic language. Its naturalness is the result of its ability to stay close to the forms of sentences usually found in every day discourse. Written by the founders of the term logic approach, An Invitation to Formal Reasoning is a unique introduction and exploration of this new system, offering numerous exercises and examples throughout the text. Summarising the standard system of mathematical logic to set term logic in context, and showing how the two systems compare, this book presents an alternative approach to standard modern logic for those studying formal logic, philosophy of language or computer theory. Fred Sommers is Professor Emeritus, Brandeis University, USA; George Englebretsen is Professor of Philosophy, Bishop's University, Canada. (shrink)

Although it is not younger than other areas of non-classical logic, paraconsistent logic has received full recognition only in recent years, largely due to the work of, among others, Newton da Costa, Graham Priest, Diderik Batens, and Jerzy Perzanowski. A logical system Λ is paraconsistent if there is a set of Λ-formulas Δ ∪ {A} such that in Λ one may derive from Δ both A and its negation, and the deductive closure of Δ with respect to Λ is different (...) from the set of all formulas. If from Δ one may derive a formula and its negation, Δ is said to be syntactically inconsistent. But is every syntactically inconsistent set of formulas contradictory? In classical logic and many non-classical logics, every syntactically inconsistent set is unsatisfiable, that is, semantically inconsistent. If contradictoriness means semantical inconsistency, there is, up to logical equivalence, only one contradiction. In paraconsistent logics, there are usually many non-equivalent formulas representing the semantically unique contradiction in a non-paraconsistent logic. So when is a formula the contradiction of another formula, and, moreover, how does the notion of contradiction relate to the notions of contrariety and negation? (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)

No detailed description available for "Negation".

We discuss aspects of the logic of negation bearing on an issue raised by Jean-Yves Béziau, recalled in §1. Contrary- and subcontrary-forming operators are introduced in §2, which examines some of their logical behaviour, leading on naturally to a consideration in §3 of dual intuitionistic negation (as well as implication), and some further operators related to intuitionistic negation. In §4, a historical explanation is suggested as to why some of these negation-related connectives have attracted more attention than others. The remaining (...) sections (§§5, 6) briefly address a question about a certain notion of global contrariety and the provision of Kripke semantics for the various operators in play in our discussion. (shrink)

According to a main idea of Gentzen the meanings of the logical constants are reflected by the introduction rules in his system of natural deduction. This idea is here understood as saying roughly that a closed argument ending with an introduction is valid provided that its immediate subarguments are valid and that other closed arguments are justified to the extent that they can be brought to introduction form. One main part of the paper is devoted to the exact development of (...) this notion. Another main part of the paper is concerned with a modification of this notion as it occurs in Michael Dummett’s book The Logical Basis of Metaphysics. The two notions are compared and there is a discussion of how they fare as a foundation for a theory of meaning. It is noted that Dummett’s notion has a simpler structure, but it is argued that it is less appropriate for the foundation of a theory of meaning, because the possession of a valid argument for a sentence in Dummett’s sense is not enough to be warranted to assert the sentence. (shrink)

The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause. The logics we present are extensions of the classical syllogistic, and we pay special attention to the question of whether reductio (...) ad absurdum is needed. Thus our main goal is to derive results on the existence (or nonexistence) of syllogistic proof systems for relational fragments. We also determine the computational complexity of all our fragments. (shrink)

The properties of negation, in combination with those of other logical operations and structural features of the deductibility relation, serve as gateways among logical systems. Negation therefore plays an important role in selecting logical systems for particular applications. This volume provides a thorough treatment of this concept, based on contributions written by authors from various branches of logic. The resulting 14 research papers address a variety of topics including negation in relevant logics; a defense of dialetheic theory of negation; stable (...) negation in logic programming; antirealism and falsity; and negation, denial, and language change in philosophical logic. Suited to scholars and graduate students in the fields of philosophy, logic mathematics, computer science, and linguistics. Annotation copyrighted by Book News, Inc., Portland, OR. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

A first-order language with a defined identity predicate is proposed whose apparatus for atomic predication is sensitive to grammatical categories of natural language. Subatomic natural deduction systems are defined for this naturalistic first-order language. These systems contain subatomic systems which govern the inferential relations which obtain between naturalistic atomic sentences and between their possibly composite components. As a main result it is shown that normal derivations in the defined systems enjoy the subexpression property which subsumes the subformula property with respect (...) to atomic and identity formulae as a special case. The systems admit a proof-theoretic semantics which does not only apply to logically compound but also to atomic and identity formulae—as well as to their components. The potential of the defined systems for a meticulous first-order analysis of natural inferences whose validity crucially depends on expressions of some of the aforementioned categories is demonstrated. (shrink)

In proof-theoretic semantics the meaning of an atomic sentence is usually determined by a set of derivations in an atomic system which contain that sentence as a conclusion (see, in particular, Prawitz, 1971, 1973). The paper critically discusses this standard approach and suggests an alternative account which proceeds in terms of subatomic introduction and elimination rules for atomic sentences. A simple subatomic normal form theorem by which this account of the semantics of atomic sentences and the terms from which they (...) are composed is underpinned, shows moreover that the proof-theoretic analysis of first-order logic can be pursued also beneath the atomic level. (shrink)

This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular paradigm, namely the proof-theoretic semantics of the logical operations.