The Complexity of Decision Procedures in Relevance Logic
Author:
- Alasdair UrquhartAUAlasdair Urquhart
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 61-76
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Petri nets and large finite setsTheoretical Computer Science, 1984
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979
- An undecidable relevant logicMathematical Logic Quarterly, 1973
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Counter machines and counter languagesTheory of Computing Systems, 1968
- A Decision Procedure For the System EĪ of Entailment with NegationMathematical Logic Quarterly, 1965
- A completeness theorem in modal logicThe Journal of Symbolic Logic, 1959
- Begründung einer strengen ImplikationThe Journal of Symbolic Logic, 1956
- Zum Hilbertschen Aufbau der reellen ZahlenMathematische Annalen, 1928