An Algebraic Approach to Non-Classical Logics

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.

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 book is dedicated to V.A. Yankov’s seminal contributions to the theory of propositional logics. His papers, published in the 1960s, are highly cited even today. The Yankov characteristic formulas have become a very useful tool in propositional, modal and algebraic logic. The papers contributed to this book provide the new results on different generalizations and applications of characteristic formulas in propositional, modal and algebraic logics. In particular, an exposition of Yankov’s results and their applications in algebraic logic, the theory of admissible rules and refutation systems is included in the book. In addition, the reader can find the studies on splitting and join-splitting in intermediate propositional logics that are based on Yankov-type formulas which are closely related to canonical formulas, and the study of properties of predicate extensions of non-classical propositional logics. The book also contains an exposition of Yankov’s revolutionary approach to constructive proof theory. The editors also include Yankov’s contributions to history and philosophy of mathematics and foundations of mathematics, as well as an examination of his original interpretation of history of Greek philosophy and mathematics.

This book is dedicated to the work of Alasdair Urquhart. The book starts out with an introduction to and an overview of Urquhart’s work, and an autobiographical essay by Urquhart. This introductory section is followed by papers on algebraic logic and lattice theory, papers on the complexity of proofs, and papers on philosophical logic and history of logic. The final section of the book contains a response to the papers by Urquhart. Alasdair Urquhart has made extremely important contributions to a variety of fields in logic. He produced some of the earliest work on the semantics of relevant logic. He provided the undecidability of the logics R (of relevant implication) and E (of relevant entailment), as well as some of their close neighbors. He proved that interpolation fails in some of those systems. Urquhart has done very important work in complexity theory, both about the complexity of proofs in classical and some nonclassical logics. In pure algebra, he has produced a representation theorem for lattices and some rather beautiful duality theorems. In addition, he has done important work in the history of logic, especially on Bertrand Russell, including editing Volume four of Russell’s Collected Papers.

Published in honor of Daniele Mundici on the occasion of his 60th birthday, the 17 revised papers of this Festschrift volume include invited extended versions of the most interesting contributions to the International Conference on the Algebraic and Logical Foundations of Many-Valued Reasoning, held in Gargnano, Italy, in March 2006. Edited in collaboration with FoLLI, the Association of Logic, Language and Information, it is the third volume of the FoLLI LNAI subline.

The first edition of the Encyclopedia of Complexity and Systems Science (ECSS, 2009) presented a comprehensive overview of granular computing (GrC) broadly divided into several categories: Granular computing from rough set theory, Granular Computing in Database Theory, Granular Computing in Social Networks, Granular Computing and Fuzzy Set Theory, Grid/Cloud Computing, as well as general issues in granular computing. In 2011, the formal theory of GrC was established, providing an adequate infrastructure to support revolutionary new approaches to computer/data science, including the challenges presented by so-called big data. For this volume of ECSS, Second Edition, many entries have been updated to capture these new developments, together with new chapters on such topics as data clustering, outliers in data mining, qualitative fuzzy sets, and information flow analysis for security applications. Granulations can be seen as a natural and ancient methodology deeply rooted in the human mind. Many daily "things" are routinely granulated into sub "things": The topography of earth is granulated into hills, plateaus, etc., space and time are granulated into infinitesimal granules, and a circle is granulated into polygons of infinitesimal sides. Such granules led to the invention of calculus, topology and non-standard analysis. Formalization of general granulation was difficult but, as shown in this volume, great progress has been made in combing discrete and continuous mathematics under one roof for a broad range of applications in data science.

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.