In previous work we gave a new proof-theoretical method for establishing upper-bounds on the space complexity of the provability problem of modal and other propositional non-classical logics. Here we extend and refine these results to give an O(n log n)-space decision procedure for the basic positive relevance logic B+. We compute this upper-bound by first giving a sound and complete, cut-free, labelled sequent system for B+, and then establishing bounds on the application of the rules of this system.
Titolo: | An O(n log n)-Space Decision Procedure for the Relevance Logic B+ |
Autori: | |
Data di pubblicazione: | 2000 |
Rivista: | |
Abstract: | In previous work we gave a new proof-theoretical method for establishing upper-bounds on the space complexity of the provability problem of modal and other propositional non-classical logics. Here we extend and refine these results to give an O(n log n)-space decision procedure for the basic positive relevance logic B+. We compute this upper-bound by first giving a sound and complete, cut-free, labelled sequent system for B+, and then establishing bounds on the application of the rules of this system. |
Handle: | http://hdl.handle.net/11562/235825 |
Appare nelle tipologie: | 01.01 Articolo in Rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.