Studia Logica 101 (6):1237-1262 (2013)

In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way
Keywords Adaptive logics  Dynamic reasoning  Standard format  Reliability strategy  Minimal abnormality strategy  Computational complexity  Expressiveness
Categories (categorize this paper)
DOI 10.1007/s11225-013-9531-2
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,159
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

A Universal Logic Approach to Adaptive Logics.Diderik Batens - 2007 - Logica Universalis 1 (1):221-242.
A General Characterization of Adaptive Logics.Diderik Batens - 2001 - Logique Et Analyse 173 (175):45-68.
Computability Theory.S. Barry Cooper - 2004 - Chapman & Hall.

View all 10 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


Added to PP index

Total views
21 ( #517,729 of 2,454,831 )

Recent downloads (6 months)
1 ( #449,241 of 2,454,831 )

How can I increase my downloads?


My notes