Adaptive Logics: Introduction, Applications, Computational Aspects and Recent Developments

Peter Verdée (Ghent) gives a talk at the MCMP Colloquium (8 Feb, 2012) titled "Adaptive Logics: Introduction, Applications, Computational Aspects and Recent Developments". Abstract: Peter Verd ́ee (peter.verdee@ugent.be) Centre for Logic and Philosophy of Science Ghent University, Belgium In this talk I give a thorough introduction to adaptive logics (cf. [1, 2, 3]). Adaptive logics are first devised by Diderik Batens and are now the main research area of the logicians in the Centre for Logic and Philosophy of Science in Ghent. First I explain the main purpose of adaptive logics: formalizing defea- sible reasoning in a unified way aiming at a normative account of fallible rationality. I give an informal characterization of what we mean by the notion ‘defeasible reasoning’ and explain why it is useful and interesting to formalize this type of reasoning by means of logics. Then I present the technical machinery of the so called standard format of adaptive logics. The standard format is a general way to define adaptive logics from three basic variables. Most existing adaptive logics can be defined within this format. It immediately provides the logics with a dynamic proof theory, a selection semantics and a number of important meta-theoretic properties. I proceed by giving some popular concrete examples of adaptive logics in standard form. I quickly introduce inconsistency adaptive logics, adap- tive logics for induction and adaptive logics for reasoning with plausible knowledge/beliefs. Next I present some computational results on adaptive logics. The adap- tive consequence relation are in general rather complex (I proved that there are recursive premise sets such that their adaptive consequence sets are Π1- complex – cf. [4]). However, I argue that this does not harm the naturalistic aims of adaptive logics, given a specific view on the relation between actual reasoning and adaptive logics. Finally, two interesting recent developments are presented: (1) Lexi- cographic adaptive logics. They fall outside of the scope of the standard format, but have similar properties and are able to handle prioritized infor- mation. (2) Adaptive set theories. Such theories start form the unrestricted comprehension axiom scheme but are strong enough to serve as a foundation for an interesting part of classical mathematics, by treating the paradoxes in a novel, defeasible way.