Alasdair Urquhart

 

Research interests: logic, computational complexity theory, history of logic, non-classical logics. Major publications: "The undecidability of entailment and relevant implication" (J. Sym. Logic, 1984); "Functional Interpretations of Feasibly constructive Arithmetic", co-authored with S.A. Cook (Annals of Pure and Applied Logic 1993); "The Complexity of Decision Procedures in Relevance Logic 11" (J. Symbolic Logic, 1999).