The complexity of decision procedures in relevance logic II

Journal of Symbolic Logic 64 (4):1774-1802 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2586811

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

External links

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

Through your library

My notes

Similar books and articles

An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
Von Neumann, Gödel and complexity theory.Alasdair Urquhart - 2010 - Bulletin of Symbolic Logic 16 (4):516-530.
An o-space decision procedure for the relevance logic b+.Luca Viganò - 2000 - Studia Logica 66 (3):385-407.
Adaptive versus veridical decision making and the frontal lobes.Elkhonon Goldberg & Kenneth Podell - 1999 - Consciousness and Cognition 8 (3):364-377.
On the complexity of the theories of weak direct powers.Charles Rackoff - 1976 - Journal of Symbolic Logic 41 (3):561-573.
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.Linh Anh Nguyen & Andrzej Szałas - 2011 - Studia Logica 98 (3):387-428.
Alasdair Urquhart. The complexity of linear logic with weakening. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Hájek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2000, pp. 500–515. [REVIEW]Herman Ruge Jervell - 2002 - Bulletin of Symbolic Logic 8 (1):100-101.
Complexity of logic-based argumentation in Post's framework.Nadia Creignou, Johannes Schmidt, Michael Thomas & Stefan Woltran - 2011 - Argument and Computation 2 (2-3):107 - 129.
Some upper and lower bounds on decision procedures in logic.Jeanne Ferrante - 1974 - Cambridge: Project MAC, Massachusetts Institute of Technology.

Analytics

Added to PP
2009-01-28

Downloads
43 (#372,848)

6 months
17 (#153,790)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alasdair Urquhart
University of Toronto, St. George Campus

Citations of this work

Admissible Rules and the Leibniz Hierarchy.James G. Raftery - 2016 - Notre Dame Journal of Formal Logic 57 (4):569-606.
Relevance Logic: Problems Open and Closed.Alasdair Urquhart - 2016 - Australasian Journal of Logic 13 (1).
Current Trends in Substructural Logics.Katalin Bimbó - 2015 - Journal of Philosophical Logic 44 (6):609-624.

Add more citations

References found in this work

Add more references