The main aim of this book is to formulate an algebraic approach to a carefully selected widest possible class of logics and to prove fundamental theorems for it, which previously have usually been proved for each of those logics separately. The second aim of this book has been to give a number of examples of logics which belong to the class above.

An Algebraic Approach to Non-Classical Logics

Classical logic is traditionally introduced by itself, but that makes it seem arbitrary and unnatural. This text introduces classical alongside several nonclassical logics (relevant, constructive, quantative, paraconsistent).

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.

This work has grown out of the lecture notes that were prepared for a series of seminars on some selected topics in quantum logic. The seminars were delivered during the first semester of the 1993/1994 academic year in the Unit for Foundations of Science of the Department of History and Foundations of Mathematics and Science, Faculty of Physics, Utrecht University, The Netherlands, while I was staying in that Unit on a European Community Research Grant, and in the Center for Philosophy of Science, University of Pittsburgh, U. S. A. , where I was staying during the 1994/1995 academic year as a Visiting Fellow on a Fulbright Research Grant, and where I also was supported by the Istvan Szechenyi Scholarship Foundation. The financial support provided by these foundations, by the Center for Philosophy of Science and by the European Community is greatly acknowledged, and I wish to thank D. Dieks, the professor of the Foundations Group in Utrecht and G. Massey, the director of the Center for Philosophy of Science in Pittsburgh for making my stay at the respective institutions possible. I also wish to thank both the members of the Foundations Group in Utrecht, especially D. Dieks, C. Lutz, F. Muller, J. Uffink and P. Vermaas and the participants in the seminars at the Center for Philosophy of Science in Pittsburgh, especially N. Belnap, J. Earman, A. Janis, J. Norton, and J.

Providing an in-depth introduction to fundamental classical and non-classical logics, this textbook offers a comprehensive survey of logics for computer scientists. Logics for Computer Science contains intuitive introductory chapters explaining the need for logical investigations, motivations for different types of logics and some of their history. They are followed by strict formal approach chapters. All chapters contain many detailed examples explaining each of the introduced notions and definitions, well chosen sets of exercises with carefully written solutions, and sets of homework. While many logic books are available, they were written by logicians for logicians, not for computer scientists. They usually choose one particular way of presenting the material and use a specialized language. Logics for Computer Science discusses Gentzen as well as Hilbert formalizations, first order theories, the Hilbert Program, Godel's first and second incompleteness theorems and their proofs. It also introduces and discusses some many valued logics, modal logics and introduces algebraic models for classical, intuitionistic, and modal S4 and S5 logics. The theory of computation is based on concepts defined by logicians and mathematicians. Logic plays a fundamental role in computer science, and this book explains the basic theorems, as well as different techniques of proving them in classical and some non-classical logics. Important applications derived from concepts of logic for computer technology include Artificial Intelligence and Software Engineering. In addition to Computer Science, this book may also find an audience in mathematics and philosophy courses, and some of the chapters are also useful for a course in Artificial Intelligence.

Abstract algebraic logic is the more general and abstract side of algebraic logic, the branch of mathematics that studies the connections between logics and their algebra-based semantics. This emerging subfield of mathematical logic consolidated since the 1980s, and is considered as the algebraic logic of the twenty-first century; as such it is increasingly becoming an indispensable tool to approach the algebraic study of any (mainly sentential) logic in a systematic way. This book is an introductory textbook on abstract algebraic logic, and takes a bottom-up approach, treating first logics with a simpler algebraic study, such as Rasiowa's implicative logics, and then guides readers, by means of successive steps of generalization and abstraction, to meet more and more complicated algebra-based semantics. An entire chapter is devoted to Blok and Pigozzi's theory of algebraizable logics, proving the main theorems and incorporating later developments by other scholars. After a chapter with the basics of the classical theory of matrices, one chapter is devoted to an in-depth exposition of the semantics of generalized matrices. There are also two more avanced chapters providing introductions to the two hierachies that organize the logical landscape according to the criteria of abstract algebraic logic, the Leibniz hierarchy and the Frege hierarchy. All throughout the book, particular care is devoted to the presentation and classification of dozens of examples of particular logics. The book is addressed to mathematicians and logicians with little or no previous exposure to algebraic logic. Some acquaintance with examples of non-classical logics is desirable in order to appreciate the extremely general theory. The book is written with students (or beginners in the field) in mind, and combines a textbook style in its main sections, including more than 400 carefully graded exercises, with a survey style in the exposition of some research directions. The book includes scattered historical notes and numerous bibliographic references.

Here is an account of recent investigations into the two main concepts of negation developed in the constructive logic: the negation as reduction to absurdity, and the strong negation. These concepts are studied in the setting of paraconsistent logic.

This book is intended for mathematicians. Its origins lie in a course of lectures given by an algebraist to a class which had just completed a substantial course on abstract algebra. Consequently, our treatment of the subject is algebraic. Although we assume a reasonable level of sophistication in algebra, the text requires little more than the basic notions of group, ring, module, etc. A more detailed knowledge of algebra is required for some of the exercises. We also assume a familiarity with the main ideas of set theory, including cardinal numbers and Zorn's Lemma. In this book, we carry out a mathematical study of the logic used in mathematics. We do this by constructing a mathematical model of logic and applying mathematics to analyse the properties of the model. We therefore regard all our existing knowledge of mathematics as being applicable to the analysis of the model, and in particular we accept set theory as part of the meta-Ianguage. We are not attempting to construct a foundation on which all mathematics is to be based--rather, any conclusions to be drawn about the foundations of mathematics come only by analogy with the model, and are to be regarded in much the same way as the conclusions drawn from any scientific theory.