Logic and Logical Philosophy 21 (3):209-228 (2012)

Abstract
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
Keywords non-monotonic logic  computational complexity  reliability strategy  inconsistency-adaptive logics  expressiveness  minimal abnormality strategy  dynamic reasoning
Categories (categorize this paper)
DOI 10.12775/LLP.2012.011
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,107
Through your library

References found in this work BETA

A General Characterization of Adaptive Logics.Diderik Batens - 2001 - Logique Et Analyse 173 (175):45-68.
[Omnibus Review].C. Smorynski - 1979 - Journal of Symbolic Logic 44 (1):116-119.

View all 7 references / Add more references

Citations of this work BETA

Adaptive Fregean Set Theory.Diderik Batens - 2020 - Studia Logica 108 (5):903-939.

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-11-24

Total views
439 ( #19,138 of 2,454,609 )

Recent downloads (6 months)
1 ( #449,377 of 2,454,609 )

How can I increase my downloads?

Downloads

My notes