论文信息 - On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics

On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics

The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuN r and CLuN m , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.

Sergei P. Odintsov | Stanislav O. Speranski | S. Odintsov | S. O. Speranski

[1] Philip D. Welch,et al. The Undecidability of Propositional Adaptive Logic , 2006, Synthese.

[2] D. Batens. A General Characterization of Adaptive Logics , 2001 .

[3] Peter Verdée. A proof procedure for adaptive logics , 2013, Log. J. IGPL.

[4] G. Boolos,et al. Self-Reference and Modal Logic , 1985 .

[5] Diderik Batens. A procedural criterion for final derivability in inconsistency-adaptive logics , 2005, J. Appl. Log..

[6] Peter Verdée,et al. Adaptive logics using the minimal abnormality strategy are $$\Pi^1_1$$ -complex , 2009, Synthese.

[7] Diderik Batens. Inconsistency-Adaptive Logics , 1999 .