Semantics for Relevant Logics. - Alasdair Urquhart (J. Symb. Log., 1972)

A semantical theory of analytic implication. - Alasdair Urquhart (J. Philos. Log., 1973)

Implicational Formulas in Intuitionistic Logic. - Alasdair Urquhart (J. Symb. Log., 1974)

Decidability and the finite model property. - Alasdair Urquhart (J. Philos. Log., 1981)

The Undecidability of Entailment and Relevant Implication. - Alasdair Urquhart (J. Symb. Log., 1984)

Hard examples for resolution. - Alasdair Urquhart (J. ACM, 1987)

A Contractionless Semilattice Semantics. - Steve Giambrone; Robert K. Meyer; Alasdair Urquhart (J. Symb. Log., 1987)

Proof Theories for Semilattice Logics. - Steve Giambrone; Alasdair Urquhart (Math. Log. Q., 1987)

Further Results on Proof Theories For Semilattice Logics. - Robert K. Meyer; Errol P. Martin; Steve Giambrone; Alasdair Urquhart (Math. Log. Q., 1988)

Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) - Stephen A. Cook; Alasdair Urquhart (STOC, 1989)

The Complexity of Gentzen Systems for Propositional Logic. - Alasdair Urquhart (Theor. Comput. Sci., 1989)

Books received. - Janusz Czelakowski; Alasdair Urquhart; Ryszard Wójcicki; Jan Wolenski; Andrzej Sendlewski; Marcin Mostowski (Stud Logica, 1990)

The Relative Complexity of Resolution and Cut-Free Gentzen Systems. - Alasdair Urquhart (Ann. Math. Artif. Intell., 1992)

Approximation and Small-Depth Frege Proofs. - Stephen J. Bellantoni; Toniann Pitassi; Alasdair Urquhart (SIAM J. Comput., 1992)

Functional Interpretations of Feasibly Constructive Arithmetic. - Stephen A. Cook; Alasdair Urquhart (Ann. Pure Appl. Log., 1993)

Failure of interpolation in relevant logics. - Alasdair Urquhart (J. Philos. Log., 1993)

Upper and Lower Bounds for Tree-Like Cutting Planes Proofs - Russell Impagliazzo; Toniann Pitassi; Alasdair Urquhart (LICS, 1994)

The complexity of propositional proofs. - Alasdair Urquhart (Bull. Symb. Log., 1995)

The Complexity of the Hajos Calculus. - Toniann Pitassi; Alasdair Urquhart (SIAM J. Discret. Math., 1995)

Simplified Lower Bounds for Propositional Proofs. - Alasdair Urquhart; Xudong Fu (Notre Dame J. Formal Log., 1996)

Duality for algebras of relevant logics. - Alasdair Urquhart (Stud Logica, 1996)

The number of lines in Frege proofs with substitution. - Alasdair Urquhart (Arch. Math. Log., 1997)

Review: Feasible Mathematics II. - Alasdair Urquhart (Log. J. IGPL, 1997)

The graph constructions of Hajós and Ore. - Alasdair Urquhart (J. Graph Theory, 1997)

The Symmetry Rule in Propositional Logic. - Alasdair Urquhart (Discret. Appl. Math., 1999)

The Complexity of Decision Procedures In Relevance Logic II. - Alasdair Urquhart (J. Symb. Log., 1999)

Local Symmetries in Propositional Logic. - Noriko H. Arai; Alasdair Urquhart (TABLEAUX, 2000)

The Complexity of Propositional Proofs. - Alasdair Urquhart (Current Trends in Theoretical Computer Science, 2001)

An Exponential Separation between Regular and General Resolution - Michael Alekhnovich; Jan Johannsen; Toniann Pitassi; Alasdair Urquhart (Electron. Colloquium Comput. Complex., 2001)

Resolution Proofs of Matching Principles. - Alasdair Urquhart (Ann. Math. Artif. Intell., 2003)

Synonymous Logics. - Francis Jeffry Pelletier; Alasdair Urquhart (J. Philos. Log., 2003)

Matrix identities and the pigeonhole principle. - Michael Soltys; Alasdair Urquhart (Arch. Math. Log., 2004)

Duality Theory for Projective Algebras. - Alasdair Urquhart (RelMiCS, 2005)

The Complexity of Propositional Proofs with the Substitution Rule. - Alasdair Urquhart (Log. J. IGPL, 2005)

Betweenness and Comparability Obtained from Binary Relations. - Ivo Düntsch; Alasdair Urquhart (RelMiCS, 2006)

The Resolution Width Problem is EXPTIME-Complete. - Alexander Hertel; Alasdair Urquhart (Electron. Colloquium Comput. Complex., 2006)

The complexity of analytic tableaux. - Noriko H. Arai; Toniann Pitassi; Alasdair Urquhart (J. Symb. Log., 2006)

Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. - Alexander Hertel; Alasdair Urquhart (CSL, 2007)

Formalizing Dangerous SAT Encodings. - Alexander Hertel; Philipp Hertel; Alasdair Urquhart (SAT, 2007)

Width versus size in resolution proofs. - Alasdair Urquhart (Theor. Comput. Sci., 2007)

Regular and General Resolution: An Improved Separation. - Alasdair Urquhart (SAT, 2008)

Supervaluation Fixed-Point Logics of Truth. - Philip Kremer; Alasdair Urquhart (J. Philos. Log., 2008)

Synonymous Logics: A Correction. - Francis Jeffry Pelletier; Alasdair Urquhart (J. Philos. Log., 2008)

Mathematical Methods in Philosophy Editors' Introduction. - Aldo Antonelli; Alasdair Urquhart; Richard Zach (Rev. Symb. Log., 2008)

Enumerating types of Boolean functions. - Alasdair Urquhart (Bull. Symb. Log., 2009)

Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete. - Alexander Hertel; Alasdair Urquhart (Electron. Colloquium Comput. Complex., 2009)

Algorithms and Complexity Results for Input and Unit Resolution. - Alexander Hertel; Alasdair Urquhart (J. Satisf. Boolean Model. Comput., 2009)

Emil Post. - Alasdair Urquhart (Logic from Russell to Church, 2009)

Proof Theory. - Alasdair Urquhart; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

Von Neumann, Gödel and complexity theory. - Alasdair Urquhart (Bull. Symb. Log., 2010)

Anderson and Belnap's Invitation to Sin. - Alasdair Urquhart (J. Philos. Log., 2010)

The Depth of Resolution Proofs. - Alasdair Urquhart (Stud Logica, 2011)

A Near-Optimal Separation of Regular and General Resolution. - Alasdair Urquhart (SIAM J. Comput., 2011)

Width and size of regular resolution proofs - Alasdair Urquhart (Log. Methods Comput. Sci., 2012)

Failure of interpolation in constant domain intuitionistic logic. - Grigori Mints; Grigory K. Olkhovikov; Alasdair Urquhart (J. Symb. Log., 2013)

S. Barry Cooper and Andrew Hodges (editors), The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp. - therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4-19. - J.M.E. Hyland. The Forgotten Turing. pp. 20-33. - Andrew R. Booker. Turing and the Primes. pp. 34-52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53-77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78-89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92-105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106-116. - Solomon Feferman. Turing's 'Oracle': From Absolute to Relative Computability and Back. pp. 300-334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335-360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361-378. - Alasdair Urquhart (Bull. Symb. Log., 2016)

Russell and Gödel. - Alasdair Urquhart (Bull. Symb. Log., 2016)

The Geometry of Relevant Implication. - Alasdair Urquhart (FLAP, 2017)