This is a preview. Log in through your library . Abstract We construct an extension $\scr{L}^{P}$ of the standard language $\scr{L}$ of classical propositional logic by adjoining to the alphabet of ...

We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of ...