David J. Pym – författare

This book is a specialized monograph on the development of the mathematical and computational metatheory of reductive logic and proof-search, areas of logic that are becoming important in computer science. A systematic foundational text on these emerging topics, it includes proof-theoretic, semantic/model-theoretic and algorithmic aspects. The scope ranges from the conceptual background to reductive logic, through its mathematical metatheory, to its modern applications in the computational sciences.Suitable for researchers and graduate students in mathematical, computational and philosophical logic, and in theoretical computer science and artificial intelligence, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism (2nd Edition), Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger's Temporal Logic Mathematical Foundations and Computational Aspects , J. M. Dunn and G. Hardegree's Algebraic Methods in Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning , and P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2 .

This monograph provides a thorough account of the model theory, proof theory and computational interpretations of BI, the logic of bunched implications, which freely combines intuitionistic logic and multiplicative intuitionistic linear logic. Starting, on the one hand, from elementary observations about modelling resources and, on the other, from a desire to develop a system of logic within which additive (or extensional) and multiplicative (or intentional) implications co-exist with equal logical status, the book gives natural deduction, l-calculi, sequent calculus, categorical semantics, Kripke models, topological models, logical relations and computational interpretations for both propositional and predicate BI, within which both additive and multiplicative quantifiers also co-exist.