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

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

The complexity of decision procedures in relevance logic II.Alasdair Urquhart - 1999 - Journal of Symbolic Logic 64 (4):1774-1802.
Relevance Logic: Problems Open and Closed.Alasdair Urquhart - 2016 - Australasian Journal of Logic 13 (1).
An analysis of empirical testing for modal decision procedures.I. Horrocks, P. Patel-Schneider & R. Sebastiani - 2000 - Logic Journal of the IGPL 8 (3):293-323.
An o-space decision procedure for the relevance logic b+.Luca Viganò - 2000 - Studia Logica 66 (3):385-407.
Some upper and lower bounds on decision procedures in logic.Jeanne Ferrante - 1974 - Cambridge: Project MAC, Massachusetts Institute of Technology.
A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief.Michael Wooldridge, Clare Dixon & Michael Fisher - 1998 - Journal of Applied Non-Classical Logics 8 (3):225-258.
δ-Complete Decision Procedures for Satisfiability over the Reals.Sicun Gao, Jeremy Avigad & Edmund M. Clarke - unknown
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity.Daniele Mundici - 1984 - Annals of Pure and Applied Logic 27 (3):265-273.
Apodeictic syllogisms: Deductions and decision procedures.Fred Johnson - 1995 - History and Philosophy of Logic 16 (1):1-18.
Von Neumann, Gödel and complexity theory.Alasdair Urquhart - 2010 - Bulletin of Symbolic Logic 16 (4):516-530.
Relevance, Conduction and Canada's Rape-Shield Decision.Derek Allen - 1993 - Informal Logic 15 (2).
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.Linh Anh Nguyen & Andrzej Szałas - 2011 - Studia Logica 98 (3):387-428.
Monotonicity and the Expressibility of NP Operators.Iain A. Stewart - 1994 - Mathematical Logic Quarterly 40 (1):132-140.
On the Relations Between Discrete and Continuous Complexity Theory.Klaus Meer - 1995 - Mathematical Logic Quarterly 41 (2):281-286.
Heinrich Behmann’s 1921 lecture on the decision problem and the algebra of logic.Paolo Mancosu & Richard Zach - 2015 - Bulletin of Symbolic Logic 21 (2):164-187.

Analytics

Added to PP
2017-02-21

Downloads
3 (#1,724,854)

6 months
3 (#1,037,180)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Alasdair Urquhart
University of Toronto, St. George Campus

Citations of this work

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

No references found.

Add more references