Alasdair Urquhart

Publication Activity (10 Years)

Years Active: 1972-2017
Publications (10 Years): 3

Top Topics

Consequence Finding

Intuitionistic Logic

Functional Dependencies

Social Bookmarking

Top Venues

Bull. Symb. Log.

Log. Methods Comput. Sci.

Publications

Alasdair Urquhart
The Geometry of Relevant Implication. FLAP 4 (3) (2017)
Alasdair Urquhart
Russell and Gödel. Bull. Symb. Log. 22 (4) (2016)
Alasdair Urquhart
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. Bull. Symb. Log. 22 (3) (2016)
Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart
Failure of interpolation in constant domain intuitionistic logic. J. Symb. Log. 78 (3) (2013)
Alasdair Urquhart
Width and size of regular resolution proofs Log. Methods Comput. Sci. 8 (2) (2012)
Alasdair Urquhart
The Depth of Resolution Proofs. Stud Logica 99 (1-3) (2011)
Alasdair Urquhart
A Near-Optimal Separation of Regular and General Resolution. SIAM J. Comput. 40 (1) (2011)
Alasdair Urquhart
Von Neumann, Gödel and complexity theory. Bull. Symb. Log. 16 (4) (2010)
Alasdair Urquhart
Anderson and Belnap's Invitation to Sin. J. Philos. Log. 39 (4) (2010)
Alexander Hertel, Alasdair Urquhart
Algorithms and Complexity Results for Input and Unit Resolution. J. Satisf. Boolean Model. Comput. 6 (1-3) (2009)
Alexander Hertel, Alasdair Urquhart
Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. 16 (2009)
Alasdair Urquhart
Enumerating types of Boolean functions. Bull. Symb. Log. 15 (3) (2009)
Philip Kremer, Alasdair Urquhart
Supervaluation Fixed-Point Logics of Truth. J. Philos. Log. 37 (5) (2008)
Alasdair Urquhart
Regular and General Resolution: An Improved Separation. SAT (2008)
Francis Jeffry Pelletier, Alasdair Urquhart
Synonymous Logics: A Correction. J. Philos. Log. 37 (1) (2008)
Aldo Antonelli, Alasdair Urquhart, Richard Zach
Mathematical Methods in Philosophy Editors' Introduction. Rev. Symb. Log. 1 (2) (2008)
Alexander Hertel, Philipp Hertel, Alasdair Urquhart
Formalizing Dangerous SAT Encodings. SAT (2007)
Alexander Hertel, Alasdair Urquhart
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. CSL (2007)
Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
An Exponential Separation between Regular and General Resolution. Theory Comput. 3 (1) (2007)
Alasdair Urquhart
Width versus size in resolution proofs. Theor. Comput. Sci. 384 (1) (2007)
Alexander Hertel, Alasdair Urquhart
The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. 13 (133) (2006)
Alasdair Urquhart
Width Versus Size in Resolution Proofs. TAMC (2006)
Ivo Düntsch, Alasdair Urquhart
Betweenness and Comparability Obtained from Binary Relations. RelMiCS (2006)
Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
The complexity of analytic tableaux. J. Symb. Log. 71 (3) (2006)
Alasdair Urquhart
Duality Theory for Projective Algebras. RelMiCS (2005)
Alasdair Urquhart
The Complexity of Propositional Proofs with the Substitution Rule. Log. J. IGPL 13 (3) (2005)
Michael Soltys, Alasdair Urquhart
Matrix identities and the pigeonhole principle. Arch. Math. Log. 43 (3) (2004)
Alasdair Urquhart
Resolution Proofs of Matching Principles. Ann. Math. Artif. Intell. 37 (3) (2003)
Francis Jeffry Pelletier, Alasdair Urquhart
Synonymous Logics. J. Philos. Log. 32 (3) (2003)
Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
An exponential separation between regular and general resolution. STOC (2002)
Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
The complexity of analytic tableaux. STOC (2001)
Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
An Exponential Separation between Regular and General Resolution Electron. Colloquium Comput. Complex. 8 (056) (2001)
Noriko H. Arai, Alasdair Urquhart
Local Symmetries in Propositional Logic. TABLEAUX (2000)
Alasdair Urquhart
The Symmetry Rule in Propositional Logic. Discret. Appl. Math. (1999)
Alasdair Urquhart
The Complexity of Decision Procedures In Relevance Logic II. J. Symb. Log. 64 (4) (1999)
Alasdair Urquhart
The Complexity of Propositional Proofs. Bull. EATCS 64 (1998)
Alasdair Urquhart
The number of lines in Frege proofs with substitution. Arch. Math. Log. 37 (1) (1997)
Alasdair Urquhart
Review: Feasible Mathematics II. Log. J. IGPL 5 (2) (1997)
Alasdair Urquhart
ajós and Ore. J. Graph Theory 26 (4) (1997)
Alasdair Urquhart
Duality for algebras of relevant logics. Stud Logica 56 (1/2) (1996)
Alasdair Urquhart, Xudong Fu
Simplified Lower Bounds for Propositional Proofs. Notre Dame J. Formal Log. 37 (4) (1996)
Toniann Pitassi, Alasdair Urquhart
The Complexity of the Hajos Calculus. SIAM J. Discret. Math. 8 (3) (1995)
Alasdair Urquhart
The complexity of propositional proofs. Bull. Symb. Log. 1 (4) (1995)
Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart
Upper and Lower Bounds for Tree-Like Cutting Planes Proofs LICS (1994)
Stephen A. Cook, Alasdair Urquhart
Functional Interpretations of Feasibly Constructive Arithmetic. Ann. Pure Appl. Log. 63 (2) (1993)
Alasdair Urquhart
Failure of interpolation in relevant logics. J. Philos. Log. 22 (5) (1993)
Alasdair Urquhart
The Relative Complexity of Resolution and Cut-Free Gentzen Systems. Ann. Math. Artif. Intell. 6 (1-3) (1992)
Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
Approximation and Small-Depth Frege Proofs. SIAM J. Comput. 21 (6) (1992)
Toniann Pitassi, Alasdair Urquhart
The Complexity of the Hajós Calculus FOCS (1992)
Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
Approximation and Small Depth Frege Proofs. Computational Complexity Conference (1991)
Janusz Czelakowski, Alasdair Urquhart, Ryszard Wójcicki, Jan Wolenski, Andrzej Sendlewski, Marcin Mostowski
Books received. Stud Logica 49 (1) (1990)
Stephen A. Cook, Alasdair Urquhart
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) STOC (1989)
Alasdair Urquhart
The Complexity of Gentzen Systems for Propositional Logic. Theor. Comput. Sci. 66 (1) (1989)
Robert K. Meyer, Errol P. Martin, Steve Giambrone, Alasdair Urquhart
Further Results on Proof Theories For Semilattice Logics. Math. Log. Q. 34 (4) (1988)
Steve Giambrone, Robert K. Meyer, Alasdair Urquhart
A Contractionless Semilattice Semantics. J. Symb. Log. 52 (2) (1987)
Steve Giambrone, Alasdair Urquhart
Proof Theories for Semilattice Logics. Math. Log. Q. 33 (5) (1987)
Alasdair Urquhart
Hard examples for resolution. J. ACM 34 (1) (1987)
Alasdair Urquhart
The Undecidability of Entailment and Relevant Implication. J. Symb. Log. 49 (4) (1984)
Alasdair Urquhart
Decidability and the finite model property. J. Philos. Log. 10 (3) (1981)
Alasdair Urquhart
Implicational Formulas in Intuitionistic Logic. J. Symb. Log. 39 (4) (1974)
Alasdair Urquhart
A semantical theory of analytic implication. J. Philos. Log. 2 (2) (1973)
Alasdair Urquhart
Semantics for Relevant Logics. J. Symb. Log. 37 (1) (1972)