Advances In Logic – serie

This book covers a broad range of up-to-date issues in non-classical logic that are of interest not only to philosophical and mathematical logicians but also to computer scientists and researchers in artificial intelligence. The problems addressed range from methodological issues in paraconsistent and deontic logic to the revision theory of truth and infinite Turing machines. The book identifies a number of important current trends in contemporary non-classical logic. Among them are dialogical and substructural logic, the classification of concepts of negation, truthmaker theory, and mathematical and foundational aspects of modal and temporal logic.

Many approaches in the field of nonmonotonic and “commonsense” reasoning are actually different representations of the same basic ideas and constructions. This book gives a logical formalization of the original, explanatory approach to nonmonotonic reasoning. It uses the basic formalism of biconsequence relations, as well as derived systems of default, autoepistemic and causal inference, to cover in a single framework such diverse systems as default logic, autoepistemic and modal nonmonotonic logics, input/output and causal logics, argumentation theory, and semantics of general logic programs with negation as failure. This approach provides a clear separation between logical (monotonic) and nonmonotonic aspects of nonmonotonic reasoning. The separation allows, in particular, to single out the logics underlying modern logic programming and restore thereby the connection between logic programming and logic.

This comprehensive book provides an adequate framework to establish various calculi of logical inference. Being an ‘enriched’ system of natural deduction, it helps to formulate logical calculi in an operational manner. By uncovering a certain harmony between a functional calculus on the labels and a logical calculus on the formulas, it allows mathematical foundations for systems of logic presentation designed to handle meta-level features at the object-level via a labelling mechanism, such as the D Gabbay's Labelled Deductive Systems. The book truly demonstrates that introducing ‘labels’ is useful to understand the proof-calculus itself, and also to clarify its connections with model-theoretic interpretations.

Fork algebras are a formalism based on the relational calculus, with interesting algebraic and metalogical properties. Their representability is especially appealing in computer science, since it allows a closer relationship between their language and models. This book gives a careful account of the results and presents some applications of Fork algebras in computer science, particularly in system specification and program construction. Many applications of Fork algebras in formal methods can be applied in many ways, and the book covers all the essentials in order to provide the reader with a better understanding.