An o-space decision procedure for the relevance logic b+

Studia Logica 66 (3):385-407 (2000)

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 -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
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005212701420
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,000
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Hiddenness Argument Revisited.J. L. Schellenberg - 2005 - Religious Studies 41 (3):287-303.
Quantum Chaos and Semiclassical Mechanics.Robert Batterman - 1992 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:50-65.
How Bad Is Rape?H. E. Baber - 1987 - Hypatia 2 (2):125-138.
Shifting Frames: From Divided to Distributed Psychologies of Scientific Agents.Peter J. Taylor - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:304-310.

Analytics

Added to PP index
2009-01-28

Total views
19 ( #419,073 of 2,236,208 )

Recent downloads (6 months)
3 ( #582,678 of 2,236,208 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature