Computability Issues for Adaptive Logics in Multi-Consequence Standard Format |
| |
| Authors: | Sergei P. Odintsov Stanislav O. Speranski |
| |
| Affiliation: | 1. Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090, Novosibirsk, Russia
2. Novosibirsk State University, 2 Pirogova St., 630090, Novosibirsk, Russia
|
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
