default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlasdair Urquhart
Person information
- affiliation: University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j46]Alasdair Urquhart:
The Geometry of Relevant Implication. FLAP 4(3) (2017)- 2016
- [j45]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): 354-356 (2016) - [j44]Alasdair Urquhart:
Russell and Gödel. Bull. Symb. Log. 22(4): 504-520 (2016) - 2013
- [j43]Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart:
Failure of interpolation in constant domain intuitionistic logic. J. Symb. Log. 78(3): 937-950 (2013) - 2012
- [j42]Alasdair Urquhart:
Width and size of regular resolution proofs. Log. Methods Comput. Sci. 8(2) (2012) - 2011
- [j41]Alasdair Urquhart:
The Depth of Resolution Proofs. Stud Logica 99(1-3): 349-364 (2011) - [j40]Alasdair Urquhart:
A Near-Optimal Separation of Regular and General Resolution. SIAM J. Comput. 40(1): 107-121 (2011) - 2010
- [j39]Alasdair Urquhart:
Von Neumann, Gödel and complexity theory. Bull. Symb. Log. 16(4): 516-530 (2010) - [j38]Alasdair Urquhart:
Anderson and Belnap's Invitation to Sin. J. Philos. Log. 39(4): 453-472 (2010) - [p2]Alasdair Urquhart, Yves Crama, Peter L. Hammer:
Proof Theory. Boolean Models and Methods 2010: 79-98
2000 – 2009
- 2009
- [j37]Alasdair Urquhart:
Enumerating types of Boolean functions. Bull. Symb. Log. 15(3): 273-299 (2009) - [j36]Alexander Hertel, Alasdair Urquhart:
Algorithms and Complexity Results for Input and Unit Resolution. J. Satisf. Boolean Model. Comput. 6(1-3): 141-164 (2009) - [r1]Alasdair Urquhart:
Emil Post. Logic from Russell to Church 2009: 617-666 - [i3]Alexander Hertel, Alasdair Urquhart:
Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j35]Francis Jeffry Pelletier, Alasdair Urquhart:
Synonymous Logics: A Correction. J. Philos. Log. 37(1): 95-100 (2008) - [j34]Philip Kremer, Alasdair Urquhart:
Supervaluation Fixed-Point Logics of Truth. J. Philos. Log. 37(5): 407-440 (2008) - [j33]Aldo Antonelli, Alasdair Urquhart, Richard Zach
:
Mathematical Methods in Philosophy Editors' Introduction. Rev. Symb. Log. 1(2): 143-145 (2008) - [c13]Alasdair Urquhart:
Regular and General Resolution: An Improved Separation. SAT 2008: 277-290 - 2007
- [j32]Alasdair Urquhart:
Width versus size in resolution proofs. Theor. Comput. Sci. 384(1): 104-110 (2007) - [j31]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. Theory Comput. 3(1): 81-102 (2007) - [c12]Alexander Hertel, Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. CSL 2007: 527-541 - [c11]Alexander Hertel, Philipp Hertel, Alasdair Urquhart:
Formalizing Dangerous SAT Encodings. SAT 2007: 159-172 - 2006
- [j30]Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart:
The complexity of analytic tableaux. J. Symb. Log. 71(3): 777-790 (2006) - [c10]Ivo Düntsch, Alasdair Urquhart:
Betweenness and Comparability Obtained from Binary Relations. RelMiCS 2006: 148-161 - [c9]Alasdair Urquhart:
Width Versus Size in Resolution Proofs. TAMC 2006: 79-88 - [i2]Alexander Hertel, Alasdair Urquhart:
The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j29]Alasdair Urquhart:
The Complexity of Propositional Proofs with the Substitution Rule. Log. J. IGPL 13(3): 287-291 (2005) - [c8]Alasdair Urquhart:
Duality Theory for Projective Algebras. RelMiCS 2005: 33-47 - 2004
- [j28]Michael Soltys, Alasdair Urquhart:
Matrix identities and the pigeonhole principle. Arch. Math. Log. 43(3): 351-358 (2004) - 2003
- [j27]Alasdair Urquhart:
Resolution Proofs of Matching Principles. Ann. Math. Artif. Intell. 37(3): 241-250 (2003) - [j26]Francis Jeffry Pelletier, Alasdair Urquhart:
Synonymous Logics. J. Philos. Log. 32(3): 259-285 (2003) - 2002
- [c7]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An exponential separation between regular and general resolution. STOC 2002: 448-456 - 2001
- [c6]Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart:
The complexity of analytic tableaux. STOC 2001: 356-363 - [p1]Alasdair Urquhart:
The Complexity of Propositional Proofs. Current Trends in Theoretical Computer Science 2001: 332-342 - [i1]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c5]Noriko H. Arai, Alasdair Urquhart:
Local Symmetries in Propositional Logic. TABLEAUX 2000: 40-51
1990 – 1999
- 1999
- [j25]Alasdair Urquhart:
The Symmetry Rule in Propositional Logic. Discret. Appl. Math. 96-97: 177-193 (1999) - [j24]Alasdair Urquhart:
The Complexity of Decision Procedures In Relevance Logic II. J. Symb. Log. 64(4): 1774-1802 (1999) - 1998
- [j23]Alasdair Urquhart:
The Complexity of Propositional Proofs. Bull. EATCS 64 (1998) - 1997
- [j22]Alasdair Urquhart:
The number of lines in Frege proofs with substitution. Arch. Math. Log. 37(1): 15-19 (1997) - [j21]Alasdair Urquhart:
Review: Feasible Mathematics II. Log. J. IGPL 5(2): 301-302 (1997) - [j20]Alasdair Urquhart:
The graph constructions of Hajós and Ore. J. Graph Theory 26(4): 211-215 (1997) - 1996
- [j19]Alasdair Urquhart, Xudong Fu:
Simplified Lower Bounds for Propositional Proofs. Notre Dame J. Formal Log. 37(4): 523-544 (1996) - [j18]Alasdair Urquhart:
Duality for algebras of relevant logics. Stud Logica 56(1/2): 263-276 (1996) - 1995
- [j17]Alasdair Urquhart:
The complexity of propositional proofs. Bull. Symb. Log. 1(4): 425-467 (1995) - [j16]Toniann Pitassi, Alasdair Urquhart:
The Complexity of the Hajos Calculus. SIAM J. Discret. Math. 8(3): 464-483 (1995) - 1994
- [c4]Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart:
Upper and Lower Bounds for Tree-Like Cutting Planes Proofs. LICS 1994: 220-228 - 1993
- [j15]Stephen A. Cook, Alasdair Urquhart:
Functional Interpretations of Feasibly Constructive Arithmetic. Ann. Pure Appl. Log. 63(2): 103-200 (1993) - [j14]Alasdair Urquhart:
Failure of interpolation in relevant logics. J. Philos. Log. 22(5): 449-479 (1993) - 1992
- [j13]Alasdair Urquhart:
The Relative Complexity of Resolution and Cut-Free Gentzen Systems. Ann. Math. Artif. Intell. 6(1-3): 157-168 (1992) - [j12]Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart:
Approximation and Small-Depth Frege Proofs. SIAM J. Comput. 21(6): 1161-1179 (1992) - [c3]Toniann Pitassi, Alasdair Urquhart:
The Complexity of the Hajós Calculus. FOCS 1992: 187-196 - 1991
- [c2]Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart:
Approximation and Small Depth Frege Proofs. SCT 1991: 367-390 - 1990
- [j11]Janusz Czelakowski, Alasdair Urquhart, Ryszard Wójcicki, Jan Wolenski, Andrzej Sendlewski, Marcin Mostowski:
Books received. Stud Logica 49(1): 151-161 (1990)
1980 – 1989
- 1989
- [j10]Alasdair Urquhart:
The Complexity of Gentzen Systems for Propositional Logic. Theor. Comput. Sci. 66(1): 87-97 (1989) - [c1]Stephen A. Cook, Alasdair Urquhart:
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract). STOC 1989: 107-112 - 1988
- [j9]Robert K. Meyer, Errol P. Martin, Steve Giambrone, Alasdair Urquhart:
Further Results on Proof Theories For Semilattice Logics. Math. Log. Q. 34(4): 301-304 (1988) - 1987
- [j8]Alasdair Urquhart:
Hard examples for resolution. J. ACM 34(1): 209-219 (1987) - [j7]Steve Giambrone, Robert K. Meyer, Alasdair Urquhart:
A Contractionless Semilattice Semantics. J. Symb. Log. 52(2): 526-529 (1987) - [j6]Steve Giambrone, Alasdair Urquhart:
Proof Theories for Semilattice Logics. Math. Log. Q. 33(5): 433-439 (1987) - 1984
- [j5]Alasdair Urquhart:
The Undecidability of Entailment and Relevant Implication. J. Symb. Log. 49(4): 1059-1073 (1984) - 1981
- [j4]Alasdair Urquhart:
Decidability and the finite model property. J. Philos. Log. 10(3): 367-370 (1981)
1970 – 1979
- 1974
- [j3]Alasdair Urquhart:
Implicational Formulas in Intuitionistic Logic. J. Symb. Log. 39(4): 661-664 (1974) - 1973
- [j2]Alasdair Urquhart:
A semantical theory of analytic implication. J. Philos. Log. 2(2): 212-219 (1973) - 1972
- [j1]Alasdair Urquhart:
Semantics for Relevant Logics. J. Symb. Log. 37(1): 159-169 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
