The aim of the present book is to give a comprehensive account of the ‘state of the art’ of substructural logics, focusing both on their proof theory and on their semantics (both algebraic and relational. It is for graduate students in either philosophy, mathematics, theoretical computer science or theoretical linguistics as well as specialists and researchers.

From the point of view of non-classical logics, Heyting's implication is the smallest implication for which the deduction theorem holds. This book studies properties of logical systems having some of the classical connectives and implication in the neighbourhood of Heyt ing's implication. I have not included anything on entailment, al though it belongs to this neighbourhood, mainly because of the appearance of the Anderson-Belnap book on entailment. In the later chapters of this book, I have included material that might be (...) of interest to the intuitionist mathematician. Originally, I intended to include more material in that spirit but I decided against it. There is no coherent body of material to include that builds naturally on the present book. There are some serious results on topological models, second order Beth and Kripke models, theories of types, etc., but it would require further research to be able to present a general theory, possibly using sheaves. That would have postponed pUblication for too long. I would like to dedicate this book to my colleagues, Professors G. Kreisel, M.O. Rabin and D. Scott. I have benefited greatly from Professor Kreisel's criticism and suggestions. Professor Rabin's fun damental results on decidability and undecidability provided the powerful tools used in obtaining the majority of the results reported in this book. Professor Scott's approach to non-classical logics and especially his analysis of the Scott consequence relation makes it possible to present Heyting's logic as a beautiful, integral part of non-classical logics. (shrink)

Recent years have been blessed with an abundance of logical systems, arising from a multitude of applications. A logic can be characterised in many different ways. Traditionally, a logic is presented via the following three components: 1. an intuitive non-formal motivation, perhaps tie it in to some application area 2. a semantical interpretation 3. a proof theoretical formulation. There are several types of proof theoretical methodologies, Hilbert style, Gentzen style, goal directed style, labelled deductive system style, and so on. The (...) tableau methodology, invented in the 1950s by Beth and Hintikka and later per fected by Smullyan and Fitting, is today one of the most popular, since it appears to bring together the proof-theoretical and the semantical approaches to the pre of a logical system and is also very intuitive. In many universities it is sentation the style first taught to students. Recently interest in tableaux has become more widespread and a community crystallised around the subject. An annual tableaux conference is being held and proceedings are published. The present volume is a Handbook a/Tableaux pre senting to the community a wide coverage of tableaux systems for a variety of logics. It is written by active members of the community and brings the reader up to frontline research. It will be of interest to any formal logician from any area. (shrink)

In the paper I exploit Frege's notions of sense and synonymity in order to amend the slingshot argument. The main emendation is to replace the assumption about logical equivalence by an assumption about synonymity. While the replaced assumption begs the question about the reference of sentences, the replacing assumption has much more theoretical support from Frege's general conception of sense and reference and the relation between them. In the paper I use a specific notion of synonymity which I believe is (...) faithful to Frege's discussion of the subject. I notice that if a stronger (and to my mind implausible) notion of synonymity is used, my version of the argument fails. The failure is explained by showing that this stronger notion of synonymity enables the assignment of facts, and not truth values, as the references of sentences. (shrink)

A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic introduction to the principal ideas and results in contemporary treatments of modality, including theorems on completeness and decidability. Illustrative chapters focus on deontic logic and conditionality. Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical equipment. Chellas here offers an (...) up-to-date and reliable guide essential for the student. (shrink)

This is a long-awaited new edition of one of the best known Oxford Logic Guides. The book gives an introduction to intuitionistic mathematics, leading the reader gently through the fundamental mathematical and philosophical concepts. The treatment of various topics, for example Brouwer's proof of the Bar Theorem, valuation systems, and the completeness of intuitionistic first-order logic, have been completely revised.

Most expressions in natural language are vague. But what is the best semantic treatment of terms like 'heap', 'red' and 'child'? And what is the logic of arguments involving this kind of vague expression? These questions are receiving increasing philosophical attention, and in this book, first published in 2000, Rosanna Keefe explores the questions of what we should want from an account of vagueness and how we should assess rival theories. Her discussion ranges widely and comprehensively over the main theories (...) of vagueness and their supporting arguments, and she offers a powerful and original defence of a form of supervaluationism, a theory that requires almost no deviation from standard logic yet can accommodate the lack of sharp boundaries to vague predicates and deal with the paradoxes of vagueness in a methodologically satisfying way. Her study will be of particular interest to readers in philosophy of language and of mind, philosophical logic, epistemology and metaphysics. (shrink)

Review of Joseph Y. Halpern (ed.), Theoretical Aspects of Reasoning About Knowledge: Proceedings of the 1986 Conference (Los Altos, CA: Morgan Kaufmann, 1986),.

The ideas of the German philosopher and mathematician Gottlob Frege lie at the root of the analytic movement in philosophy; Michael Dummett is his leading modern critical interpreter and one of today's most eminent philosophers. This volume collects together fifteen of Dummett's classic essays on Frege and related subjects.

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 revised and considerably expanded 2nd edition brings together a wide range of topics, including modal, tense, conditional, intuitionist, many-valued, paraconsistent, relevant, and fuzzy logics. Part 1, on propositional logic, is the old Introduction, but contains much new material. Part 2 is entirely new, and covers quantification and identity for all the logics in Part 1. The material is unified by the underlying theme of world semantics. All of the topics are explained clearly using devices such as tableau proofs, and (...) their relation to current philosophical issues and debates are discussed. Students with a basic understanding of classical logic will find this book an invaluable introduction to an area that has become of central importance in both logic and philosophy. It will also interest people working in mathematics and computer science who wish to know about the area. (shrink)

According to Suszko's Thesis,any multi-valued semantics for a logical system can be replaced by an equivalent bivalent one. Moreover: bivalent semantics for families of logics can frequently be developed in a modular way. On the other hand bivalent semantics usually lacks the crucial property of analycity, a property which is guaranteed for the semantics of multi-valued matrices. We show that one can get both modularity and analycity by using the semantic framework of multi-valued non-deterministic matrices. We further show that for (...) using this framework in a constructive way it is best to view "truth-values" as information carriers, or "information-values". (shrink)

The famous “slingshot argument” developed by Church, Gödel, Quine and Davidson is often considered to be a formally strict proof of the Fregean conception that all true sentences, as well as all false ones, have one and the same denotation, namely their corresponding truth value: the true or the false . In this paper we examine the analysis of the slingshot argument by means of a non-Fregean logic undertaken recently by A.Wóitowicz and put to the test her claim that the (...) slingshot argument is in fact circular and presupposes what it intends to prove. We show that this claim is untenable. Nevertheless, the language of non-Fregean logic can serve as a useful tool for representing the slingshot argument, and several versions of the slingshot argument in non-Fregean logics are presented. In particular, a new version of the slingshot argument is presented, which can be circumvented neither by an appeal to a Russellian theory of definite descriptions nor by resorting to an analogous “Russellian” theory of λ–terms. (shrink)

According to Suszko’s Thesis, there are but two logical values, true and false. In this paper, R. Suszko’s, G. Malinowski’s, and M. Tsuji’s analyses of logical twovaluedness are critically discussed. Another analysis is presented, which favors a notion of a logical system as encompassing possibly more than one consequence relation. [A] fundamental problem concerning many-valuedness is to know what it really is. [13, p. 281].

We study an application of gaggle theory to unary negative modal operators. First we treat negation as impossibility and get a minimal logic system Ki that has a perp semantics. Dunn 's kite of different negations can be dealt with in the extensions of this basic logic Ki. Next we treat negation as “unnecessity” and use a characteristic semantics for different negations in a kite which is dual to Dunn 's original one. Ku is the minimal logic that has a (...) characteristic semantics. We also show that Shramko's falsification logic FL can be incorporated into some extension of this basic logic Ku. Finally, we unite the two basic logics Ki and Ku together to get a negative modal logic K-, which is dual to the positive modal logic K+ in [7]. Shramko has suggested an extension of Dunn 's kite and also a dual version in [12]. He also suggested combining them into a “united” kite. We give a united semantics for this united kite of negations. (shrink)

We consider a logic which is semantically dual (in some precise sense of the term) to intuitionistic. This logic can be labeled as “falsification logic”: it embodies the Popperian methodology of scientific discovery. Whereas intuitionistic logic deals with constructive truth and non-constructive falsity, and Nelson's logic takes both truth and falsity as constructive notions, in the falsification logic truth is essentially non-constructive as opposed to falsity that is conceived constructively. We also briefly clarify the relationships of our falsification logic to (...) some other logical systems. (shrink)

In this paper we introduce and compare four different syntactic methods for generating sequent calculi for the main systems of modal logic: the multiple sequents method, the higher-arity sequents method, the tree-hypersequents method and the display method. More precisely we show how the first three methods can all be translated in the fourth one. This result sheds new light on these generalisations of the sequent calculus and raises issues that will be examined in the last section.

In this paper, I identify the source of the differences between classical logic and many-valued logics (including fuzzy logics) with respect to the set of valid formulas and the set of inferences sanctioned. In the course of doing so, we find the conditions that are individually necessary and jointly sufficient for any many-valued semantics (again including fuzzy logics) to validate exactly the classically valid formulas, while sanctioning exactly the same set of inferences as classical logic. This in turn shows, contrary (...) to what has sometimes been claimed, that at least one class of infinite-valued semantics is axiomatizable. (shrink)

In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = ������(2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an (...) information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN₃ coincide with the logic of FOUR₂, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arieli's and Avron's notion of a logical bilattice and state a number of open problems for future research. (shrink)

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

_Identity and Discrimination_, originally published in 1990 and the first book by respected philosopher Timothy Williamson, is now reissued and updated with the inclusion of significant new material. Williamson here proposes an original and rigorous theory linking identity, a relation central to metaphysics, and indiscriminability, a relation central to epistemology.__ Updated and reissued edition of Williamson’s first publication, with the inclusion of significant new material Argues for an original cognitive account of the relation between identity and discrimination that has been (...) influential in the philosophy of perception Pioneers the use of epistemic logic to solve puzzles about indiscriminability Develops the application of techniques from mathematical logic to understand issues about identity over time and across possible worlds. (shrink)

This first textbook on formal concept analysis gives a systematic presentation of the mathematical foundations and their relations to applications in computer science, especially in data analysis and knowledge processing. Above all, it presents graphical methods for representing conceptual systems that have proved themselves in communicating knowledge. The mathematical foundations are treated thoroughly and are illuminated by means of numerous examples, making the basic theory readily accessible in compact form.

Completely revised and updated in its Second Edition, Language and Reality provides students, philosophers and cognitive scientists with a lucid and provocative introduction to the philosophy of language.

These notes are a corrected and revised version of notes which accompanied lectures given at the Banach Center in the fall of 1991. The intent is to give a self-contained introduction to cylindric algebras from the concrete point of view. I hope that after reading this introduction the reader will be able to digest the basic works on this subject results about them as we go along. And we will try to motivate the notions from logic. See the end of (...) these notes for indices of symbols and words.Cylindric algebras form the most developed form of algebraic logic. In general, algebraic logic is concerned with algebraic structures which correspond to logics of various sorts. Cylindric algebras correspond to ordinary first order logics and to certain straightforward modifications of these logics. Other algebraic structures have a similar relationship to first order logic; the most developed of these are relation algebras and polyadic algebras. We will not be concerned with these, but the reader should be able to study them more easily after reading these notes.We will describe only the concrete aspect of cylindric algebras. The axiomatic version, fully developed in Henkin, Monk, Tarski [19], will play only a minor role. Also, we will not deal with applications. Such applications exist in several other fields, such as combinatorics and theoretical computer science.We assume familiarity with the elementary theory of Boolean algebras, elementary first order logic, and with the basics of universal algebra. (shrink)