The Dynamic Turn in Paraconsistency
Organizations: Institute of Philosophy and Human Sciences, UNICAMP Campinas, Brazil · University of Toulouse, IRIT-CNRS Toulouse, France
Abstract
In this work we propose a dynamic turn in paraconsistency. We introduce AMLFI1, the action model extension of the paraconsistent logic LFI1. A special case is PALFI1, a paraconsistent logic of public announcements. It corresponds to another, recently published, paraconsistent public announcement logic: the differences in their axiomatizations are mutually admissible. We also introduce UMLFI1, that extends AMLFI1 with factual change. Soundness and completeness are proven for all logics, and all extend the epistemic paraconsistent logics KLFI1, KB4LFI1 and S5LFI1, known from the literature. With such dynamic epistemic paraconsistent logics we can formalize obtaining and resolving provisional contradictions.
Explore similar work
AGM-like Paraconsistent Partial Meet Abductive Expansion Operation
Study on Quantitative Dynamic Epistemic Logic for Belief Revision
$P$'. This logic formalizes static epistemic states and has greater expressive power than AGM in doing so because it captures the quantitative notion of "degrees of conviction". The third step is to introduce revision operators on $P$ and, mostly following (van Ditmarsch, 2005), obtain the Dynamic Epistemic Logic (DEL) I call '. It models processes of belief revision in several ways. Original results are presented in the following two sections. The first one of these sections revolves around a formalization of AGM postulates within by proving some theorems related to the satisfaction of those postulates by revisions defined in . The last section features an analysis of 's revisions that go beyond the mere satisfaction of postulates. I compare their formal behavior with respect to some philosophical criteria. At last, I conclude that the functions presented in (van Ditmarsch, 2005) are not good formalizations of the philosophical intuition behind AGM. Instead, it is captured by the function originally defined in this paper (but highly inspired by (van Benthem, 2007)). An implementation of this function is also provided.