Alasdair Urquhart
Affiliations: University of Toronto, Canada
According to our database^{1},
Alasdair Urquhart
authored at least 58 papers
between 1972 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on viaf.org

on id.loc.gov

on dnb.info

on andrej.com

on isni.org
On csauthors.net:
Bibliography
2017
FLAP, 2017
2016
Bull. Symb. Log., 2016
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. 419.  J.M.E. Hyland. The Forgotten Turing. pp. 2033.  Andrew R. Booker. Turing and the Primes. pp. 3452.  Ueli Maurer. Cryptography and Computation after Turing. pp. 5377.  Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 7889.  Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92105.  Christof Teuscher. Designed versus Intrinsic Computation. pp. 106116.  Solomon Feferman. Turing's 'Oracle': From Absolute to Relative Computability and Back. pp. 300334.  P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335360.  Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361378.
Bull. Symb. Log., 2016
2013
J. Symb. Log., 2013
2012
Log. Methods Comput. Sci., 2012
2011
SIAM J. Comput., 2011
Stud Logica, 2011
2010
J. Philos. Log., 2010
Bull. Symb. Log., 2010
Proceedings of the Boolean Models and Methods in Mathematics, 2010
2009
Proceedings of the Logic from Russell to Church, 2009
J. Satisf. Boolean Model. Comput., 2009
Comments on ECCC Report TR06133: The Resolution Width Problem is EXPTIMEComplete.
Electron. Colloquium Comput. Complex., 2009
Bull. Symb. Log., 2009
2008
Rev. Symb. Log., 2008
J. Philos. Log., 2008
J. Philos. Log., 2008
Proceedings of the Theory and Applications of Satisfiability Testing, 2008
2007
Theor. Comput. Sci., 2007
Proceedings of the Theory and Applications of Satisfiability Testing, 2007
Proceedings of the Computer Science Logic, 21st International Workshop, 2007
2006
J. Symb. Log., 2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006
2005
Log. J. IGPL, 2005
Proceedings of the Relational Methods in Computer Science, 2005
2004
Arch. Math. Log., 2004
2003
J. Philos. Log., 2003
Ann. Math. Artif. Intell., 2003
2001
Electron. Colloquium Comput. Complex., 2001
The Complexity of Propositional Proofs.
Proceedings of the Current Trends in Theoretical Computer Science, 2001
2000
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000
1999
J. Symb. Log., 1999
Discret. Appl. Math., 1999
1997
J. Graph Theory, 1997
Log. J. IGPL, 1997
Arch. Math. Log., 1997
1996
Stud Logica, 1996
Notre Dame J. Formal Log., 1996
1995
SIAM J. Discret. Math., 1995
Bull. Symb. Log., 1995
1994
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994
1993
J. Philos. Log., 1993
Ann. Pure Appl. Log., 1993
1992
SIAM J. Comput., 1992
Ann. Math. Artif. Intell., 1992
1990
Stud Logica, 1990
1989
Theor. Comput. Sci., 1989
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
1988
Math. Log. Q., 1988
1987
Math. Log. Q., 1987
J. Symb. Log., 1987
J. ACM, 1987
1984
J. Symb. Log., 1984
1981
J. Philos. Log., 1981
1974
J. Symb. Log., 1974
1973
J. Philos. Log., 1973
1972
J. Symb. Log., 1972