Jonas De Vuyst

It has been observed many times before that, as yet, there are no encompassing, integrated theories of mathematical practice available.To witness, as we currently do, a variety of schools in this field elaborating their philosophical frameworks, and trying to sort out their differences in the course of doing so, is also to be constantly reminded of the fact that a lot of epistemic aspects, extremely relevant to this task, remain dramatically underexamined. This volume wants to contribute to the stock of studies filling this perceived lacuna. It contains papers by established, upcoming, as well as beginning scholars, covering general, metaphilosophical themes such as naturalism, semiotics, pragmaticism, or empiricism, next to more specific topics including the unity of mathematical theories, thruth-flow in mathematics, diagrammatic reasoning, erroneous argumentation, or numerical analysis.

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. This dissertation focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language.