The complexity of decision procedures in relevance logic II

Journal of Symbolic Logic

Volumn 64, Issue 4, 1999, Pages 1774-1802

  Urquhart, Alasdair ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033272084     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586811     Document Type: Article

References (20)

1. A. R. ANDERSON and N. D. BELNAP JR., Entailment, vol. 1, Princeton University Press, Princeton, NJ, 1975.
2. A. R. ANDERSON, N. D. BELNAP JR., and J. M. DUNN, Entailment, vol. 2, Princeton University Press, Princeton, NJ, 1992.
3. I-of entailment with negation, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 277-289.
4. L.E. DICKSON, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, American Journal of Mathematics, vol. 35 (1913), pp. 413-422.
5. P.C. FISCHER, A.R. MEYER, and A.L. ROSENBERG, Counter machines and counter languages, Mathematical Systems Theory, vol. 2 (1968), pp. 265-283.
6. G. HIGMAN, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society, vol. 2 (1952), pp. 326-336.
7. JOHN E. HOPCROFT and JEFFREY D. ULLMAN, Introduction to automata theory, languages and computation, Addison-Wesley, 1979.
8. R.M. KARP and R.E. MILLER, Parallel program schemata, Journal of Computer and System Sciences, vol. 3 (1969), pp. 147-195.
9. SAUL A. KRIPKE, The problem of entailment, this JOURNAL, vol. 24 (1959), p. 324, Abstract.
10. P. LINCOLN, J. MITCHELL, A. SCEDROV, and N. SHANKAR, Decision problems for propositional linear logic, Annals of Pure and Applied Logic, vol. 56 (1992), pp. 239-311.
11. ERNST W. MAYR and ALBERT R. MEYER, The complexity of the finite containment problem for Petri nets, Journal of the Association for Computing Machinery, vol. 28 (1981), pp. 561-576.
12. KENNETH MCALOON, Petri nets and large finite sets, Theoretical Computer Science, vol. 32 (1984), pp. 173-183.
13. R.K. MEYER, Topics in modal and many-valued logic, Ph.D. thesis, University of Pittsburgh, Pennsylvania, 1966.
14. +, Bulletin of the Section of Logic, Polish Academy of Sciences, vol. 9 (1980), pp. 30-32.
15. H.E. ROSE, Subrecursion: functions and hierarchies, Oxford University Press, Oxford, 1984, Oxford Logic Guides 9.
16. STEPHEN G. SIMPSON, Ordinal numbers and the Hilbert basis theorem, this JOURNAL, vol. 53 (1988), pp. 961-974.
17. P.B. THISTLEWAITE, M.A. MCROBBIE, and R.K. MEYER, Automated theorem-proving in nonclassical logics, Pitman, London, 1988.
18. ANNE S. TROELSTRA, Lectures on linear logic, CSLI, Menlo Park, California, 1992, CSLI Lecture Notes Number 29.
19. ALASDAIR URQUHART, The undecidability of entailmenl and relevant implication, this JOURNAL, vol. 49 (1984), pp. 1059-1073.
20. _, The complexity of decision procedures in relevance logic, Truth or consequences: Essays in honour of Nuel Belnap (J. Michael Dunn and Anil Gupta, editors), Kluwer, Dordrecht, 1990, pp. 61-76.