Computability Issues for Adaptive Logics in Multi-Consequence Standard Format

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

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,480

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-11-09

Downloads
21 (#536,903)

6 months
1 (#417,896)

Historical graph of downloads
How can I increase my downloads?