Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s11225-013-9531-2 | Studia Logica |
Keywords | Field | DocType |
Adaptive logics,Dynamic reasoning,Standard format,Reliability strategy,Minimal abnormality strategy,Computational complexity,Expressiveness | T-norm fuzzy logics,Discrete mathematics,Algorithm,Computability,Completeness (statistics),Mathematics,Computational complexity theory,Expressivity | Journal |
Volume | Issue | ISSN |
101 | 6 | 0039-3215 |
Citations | PageRank | References |
3 | 0.43 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergei P. Odintsov | 1 | 126 | 11.68 |
| Stanislav O. Speranski | 2 | 13 | 3.98 |