Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Alasdair Urquhart
@article{DBLP:journals/flap/Urquhart17,
author = {Alasdair Urquhart},
title = {The Geometry of Relevant Implication},
journal = {{FLAP}},
volume = {4},
number = {3},
year = {2017},
url = {http://www.collegepublications.co.uk/downloads/ifcolog00012.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/flap/Urquhart17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/Urquhart16,
author = {Alasdair Urquhart},
title = {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},
journal = {Bull. Symb. Log.},
volume = {22},
number = {3},
pages = {354--356},
year = {2016},
url = {https://doi.org/10.1017/bsl.2016.19},
doi = {10.1017/BSL.2016.19},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Urquhart16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/Urquhart16a,
author = {Alasdair Urquhart},
title = {Russell and G{\"{o}}del},
journal = {Bull. Symb. Log.},
volume = {22},
number = {4},
pages = {504--520},
year = {2016},
url = {https://doi.org/10.1017/bsl.2016.35},
doi = {10.1017/BSL.2016.35},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Urquhart16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/MintsOU13,
author = {Grigori Mints and
Grigory K. Olkhovikov and
Alasdair Urquhart},
title = {Failure of interpolation in constant domain intuitionistic logic},
journal = {J. Symb. Log.},
volume = {78},
number = {3},
pages = {937--950},
year = {2013},
url = {https://doi.org/10.2178/jsl.7803120},
doi = {10.2178/JSL.7803120},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/MintsOU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-1050,
author = {Alasdair Urquhart},
title = {Width and size of regular resolution proofs},
journal = {Log. Methods Comput. Sci.},
volume = {8},
number = {2},
year = {2012},
url = {https://doi.org/10.2168/LMCS-8(2:8)2012},
doi = {10.2168/LMCS-8(2:8)2012},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-1050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/Urquhart11,
author = {Alasdair Urquhart},
title = {The Depth of Resolution Proofs},
journal = {Stud Logica},
volume = {99},
number = {1-3},
pages = {349--364},
year = {2011},
url = {https://doi.org/10.1007/s11225-011-9356-9},
doi = {10.1007/S11225-011-9356-9},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/Urquhart11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Urquhart11,
author = {Alasdair Urquhart},
title = {A Near-Optimal Separation of Regular and General Resolution},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {1},
pages = {107--121},
year = {2011},
url = {https://doi.org/10.1137/090772897},
doi = {10.1137/090772897},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Urquhart11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/Urquhart10,
author = {Alasdair Urquhart},
title = {Von Neumann, G{\"{o}}del and complexity theory},
journal = {Bull. Symb. Log.},
volume = {16},
number = {4},
pages = {516--530},
year = {2010},
url = {https://doi.org/10.2178/bsl/1294171130},
doi = {10.2178/BSL/1294171130},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Urquhart10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/Urquhart10,
author = {Alasdair Urquhart},
title = {Anderson and Belnap's Invitation to Sin},
journal = {J. Philos. Log.},
volume = {39},
number = {4},
pages = {453--472},
year = {2010},
url = {https://doi.org/10.1007/s10992-010-9135-5},
doi = {10.1007/S10992-010-9135-5},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/Urquhart10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/10/UrquhartCH10,
author = {Alasdair Urquhart and
Yves Crama and
Peter L. Hammer},
editor = {Yves Crama and
Peter L. Hammer},
title = {Proof Theory},
booktitle = {Boolean Models and Methods in Mathematics, Computer Science, and Engineering},
pages = {79--98},
publisher = {Cambridge University Press},
year = {2010},
url = {https://doi.org/10.1017/cbo9780511780448.006},
doi = {10.1017/CBO9780511780448.006},
timestamp = {Mon, 16 Sep 2019 14:43:07 +0200},
biburl = {https://dblp.org/rec/books/cu/10/UrquhartCH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/Urquhart09,
author = {Alasdair Urquhart},
title = {Enumerating types of Boolean functions},
journal = {Bull. Symb. Log.},
volume = {15},
number = {3},
pages = {273--299},
year = {2009},
url = {https://doi.org/10.2178/bsl/1246453975},
doi = {10.2178/BSL/1246453975},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Urquhart09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HertelU09,
author = {Alexander Hertel and
Alasdair Urquhart},
title = {Algorithms and Complexity Results for Input and Unit Resolution},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {141--164},
year = {2009},
url = {https://doi.org/10.3233/sat190066},
doi = {10.3233/SAT190066},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HertelU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/hhl/Urquhart09,
author = {Alasdair Urquhart},
editor = {Dov M. Gabbay and
John Woods},
title = {Emil Post},
booktitle = {Logic from Russell to Church},
series = {Handbook of the History of Logic},
volume = {5},
pages = {617--666},
publisher = {Elsevier},
year = {2009},
url = {https://doi.org/10.1016/S1874-5857(09)70016-0},
doi = {10.1016/S1874-5857(09)70016-0},
timestamp = {Thu, 09 Jul 2020 09:13:36 +0200},
biburl = {https://dblp.org/rec/series/hhl/Urquhart09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HertelU09,
author = {Alexander Hertel and
Alasdair Urquhart},
title = {Comments on {ECCC} Report {TR06-133:} The Resolution Width Problem
is EXPTIME-Complete},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-003}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/003},
eprinttype = {ECCC},
eprint = {TR09-003},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HertelU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/PelletierU08,
author = {Francis Jeffry Pelletier and
Alasdair Urquhart},
title = {Synonymous Logics: {A} Correction},
journal = {J. Philos. Log.},
volume = {37},
number = {1},
pages = {95--100},
year = {2008},
url = {https://doi.org/10.1007/s10992-007-9062-2},
doi = {10.1007/S10992-007-9062-2},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/PelletierU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/KremerU08,
author = {Philip Kremer and
Alasdair Urquhart},
title = {Supervaluation Fixed-Point Logics of Truth},
journal = {J. Philos. Log.},
volume = {37},
number = {5},
pages = {407--440},
year = {2008},
url = {https://doi.org/10.1007/s10992-007-9071-1},
doi = {10.1007/S10992-007-9071-1},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/KremerU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsl/AntonelliUZ08,
author = {Aldo Antonelli and
Alasdair Urquhart and
Richard Zach},
title = {Mathematical Methods in Philosophy Editors' Introduction},
journal = {Rev. Symb. Log.},
volume = {1},
number = {2},
pages = {143--145},
year = {2008},
url = {https://doi.org/10.1017/S1755020308080131},
doi = {10.1017/S1755020308080131},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsl/AntonelliUZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Urquhart08,
author = {Alasdair Urquhart},
editor = {Hans Kleine B{\"{u}}ning and
Xishun Zhao},
title = {Regular and General Resolution: An Improved Separation},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2008, 11th
International Conference, {SAT} 2008, Guangzhou, China, May 12-15,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4996},
pages = {277--290},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79719-7\_26},
doi = {10.1007/978-3-540-79719-7\_26},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/Urquhart08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Urquhart07,
author = {Alasdair Urquhart},
title = {Width versus size in resolution proofs},
journal = {Theor. Comput. Sci.},
volume = {384},
number = {1},
pages = {104--110},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.05.022},
doi = {10.1016/J.TCS.2007.05.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Urquhart07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AlekhnovichJPU07,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
title = {An Exponential Separation between Regular and General Resolution},
journal = {Theory Comput.},
volume = {3},
number = {1},
pages = {81--102},
year = {2007},
url = {https://doi.org/10.4086/toc.2007.v003a005},
doi = {10.4086/TOC.2007.V003A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/AlekhnovichJPU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/HertelU07,
author = {Alexander Hertel and
Alasdair Urquhart},
editor = {Jacques Duparc and
Thomas A. Henzinger},
title = {Game Characterizations and the PSPACE-Completeness of Tree Resolution
Space},
booktitle = {Computer Science Logic, 21st International Workshop, {CSL} 2007, 16th
Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4646},
pages = {527--541},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74915-8\_39},
doi = {10.1007/978-3-540-74915-8\_39},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/HertelU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HertelHU07,
author = {Alexander Hertel and
Philipp Hertel and
Alasdair Urquhart},
editor = {Jo{\~{a}}o Marques{-}Silva and
Karem A. Sakallah},
title = {Formalizing Dangerous {SAT} Encodings},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2007, 10th
International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4501},
pages = {159--172},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72788-0\_18},
doi = {10.1007/978-3-540-72788-0\_18},
timestamp = {Mon, 24 Feb 2020 19:23:27 +0100},
biburl = {https://dblp.org/rec/conf/sat/HertelHU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/AraiPU06,
author = {Noriko H. Arai and
Toniann Pitassi and
Alasdair Urquhart},
title = {The complexity of analytic tableaux},
journal = {J. Symb. Log.},
volume = {71},
number = {3},
pages = {777--790},
year = {2006},
url = {https://doi.org/10.2178/jsl/1154698576},
doi = {10.2178/JSL/1154698576},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/AraiPU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/RelMiCS/DuntschU06,
author = {Ivo D{\"{u}}ntsch and
Alasdair Urquhart},
editor = {Renate A. Schmidt},
title = {Betweenness and Comparability Obtained from Binary Relations},
booktitle = {Relations and Kleene Algebra in Computer Science, 9th International
Conference on Relational Methods in Computer Science and 4th International
Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester,
UK, August 29-September 2, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4136},
pages = {148--161},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11828563\_10},
doi = {10.1007/11828563\_10},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/RelMiCS/DuntschU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Urquhart06,
author = {Alasdair Urquhart},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Angsheng Li},
title = {Width Versus Size in Resolution Proofs},
booktitle = {Theory and Applications of Models of Computation, Third International
Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3959},
pages = {79--88},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11750321\_6},
doi = {10.1007/11750321\_6},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Urquhart06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HertelU06,
author = {Alexander Hertel and
Alasdair Urquhart},
title = {The Resolution Width Problem is EXPTIME-Complete},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-133}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-133/index.html},
eprinttype = {ECCC},
eprint = {TR06-133},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HertelU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/Urquhart05,
author = {Alasdair Urquhart},
title = {The Complexity of Propositional Proofs with the Substitution Rule},
journal = {Log. J. {IGPL}},
volume = {13},
number = {3},
pages = {287--291},
year = {2005},
url = {https://doi.org/10.1093/jigpal/jzi021},
doi = {10.1093/JIGPAL/JZI021},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/Urquhart05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/RelMiCS/Urquhart05,
author = {Alasdair Urquhart},
editor = {Wendy MacCaull and
Michael Winter and
Ivo D{\"{u}}ntsch},
title = {Duality Theory for Projective Algebras},
booktitle = {Relational Methods in Computer Science, 8th International Seminar
on Relational Methods in Computer Science, 3rd International Workshop
on Applications of Kleene Algebra, and Workshop of {COST} Action 274:
TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3929},
pages = {33--47},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11734673\_3},
doi = {10.1007/11734673\_3},
timestamp = {Wed, 01 Apr 2020 16:14:32 +0200},
biburl = {https://dblp.org/rec/conf/RelMiCS/Urquhart05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/SoltysU04,
author = {Michael Soltys and
Alasdair Urquhart},
title = {Matrix identities and the pigeonhole principle},
journal = {Arch. Math. Log.},
volume = {43},
number = {3},
pages = {351--358},
year = {2004},
url = {https://doi.org/10.1007/s00153-003-0205-z},
doi = {10.1007/S00153-003-0205-Z},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/SoltysU04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Urquhart03,
author = {Alasdair Urquhart},
title = {Resolution Proofs of Matching Principles},
journal = {Ann. Math. Artif. Intell.},
volume = {37},
number = {3},
pages = {241--250},
year = {2003},
url = {https://doi.org/10.1023/A:1021231610627},
doi = {10.1023/A:1021231610627},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/Urquhart03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/PelletierU03,
author = {Francis Jeffry Pelletier and
Alasdair Urquhart},
title = {Synonymous Logics},
journal = {J. Philos. Log.},
volume = {32},
number = {3},
pages = {259--285},
year = {2003},
url = {https://doi.org/10.1023/A:1024248828122},
doi = {10.1023/A:1024248828122},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/PelletierU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekhnovichJPU02,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
editor = {John H. Reif},
title = {An exponential separation between regular and general resolution},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {448--456},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509974},
doi = {10.1145/509907.509974},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlekhnovichJPU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AraiPU01,
author = {Noriko H. Arai and
Toniann Pitassi and
Alasdair Urquhart},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {The complexity of analytic tableaux},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {356--363},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380822},
doi = {10.1145/380752.380822},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AraiPU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ws/phaunRS01/Urquhart01,
author = {Alasdair Urquhart},
editor = {Gheorghe Paun and
Grzegorz Rozenberg and
Arto Salomaa},
title = {The Complexity of Propositional Proofs},
booktitle = {Current Trends in Theoretical Computer Science, Entering the 21th
Century},
pages = {332--342},
publisher = {World Scientific},
year = {2001},
timestamp = {Sat, 03 Aug 2019 22:52:51 +0200},
biburl = {https://dblp.org/rec/books/ws/phaunRS01/Urquhart01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-056,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
title = {An Exponential Separation between Regular and General Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-056}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-056/index.html},
eprinttype = {ECCC},
eprint = {TR01-056},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tableaux/AraiU00,
author = {Noriko H. Arai and
Alasdair Urquhart},
editor = {Roy Dyckhoff},
title = {Local Symmetries in Propositional Logic},
booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods, International
Conference, {TABLEAUX} 2000, St Andrews, Scotland, UK, July 3-7, 2000,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1847},
pages = {40--51},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10722086\_3},
doi = {10.1007/10722086\_3},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/tableaux/AraiU00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Urquhart99,
author = {Alasdair Urquhart},
title = {The Symmetry Rule in Propositional Logic},
journal = {Discret. Appl. Math.},
volume = {96-97},
pages = {177--193},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00039-6},
doi = {10.1016/S0166-218X(99)00039-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Urquhart99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Urquhart99,
author = {Alasdair Urquhart},
title = {The Complexity of Decision Procedures In Relevance Logic {II}},
journal = {J. Symb. Log.},
volume = {64},
number = {4},
pages = {1774--1802},
year = {1999},
url = {https://doi.org/10.2307/2586811},
doi = {10.2307/2586811},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Urquhart99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Urquhart98,
author = {Alasdair Urquhart},
title = {The Complexity of Propositional Proofs},
journal = {Bull. {EATCS}},
volume = {64},
year = {1998},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Urquhart98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Urquhart97,
author = {Alasdair Urquhart},
title = {The number of lines in Frege proofs with substitution},
journal = {Arch. Math. Log.},
volume = {37},
number = {1},
pages = {15--19},
year = {1997},
url = {https://doi.org/10.1007/s001530050078},
doi = {10.1007/S001530050078},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Urquhart97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/Urquhart97,
author = {Alasdair Urquhart},
title = {Review: Feasible Mathematics {II}},
journal = {Log. J. {IGPL}},
volume = {5},
number = {2},
pages = {301--302},
year = {1997},
url = {https://doi.org/10.1093/jigpal/5.2.301},
doi = {10.1093/JIGPAL/5.2.301},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/Urquhart97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Urquhart97,
author = {Alasdair Urquhart},
title = {The graph constructions of \emph{H}aj{\'{o}}s and Ore},
journal = {J. Graph Theory},
volume = {26},
number = {4},
pages = {211--215},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199712)26:4\&\#60;211::AID-JGT5\&\#62;3.0.CO;2-T},
doi = {10.1002/(SICI)1097-0118(199712)26:4\&\#60;211::AID-JGT5\&\#62;3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Urquhart97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/UrquhartF96,
author = {Alasdair Urquhart and
Xudong Fu},
title = {Simplified Lower Bounds for Propositional Proofs},
journal = {Notre Dame J. Formal Log.},
volume = {37},
number = {4},
pages = {523--544},
year = {1996},
url = {https://doi.org/10.1305/ndjfl/1040046140},
doi = {10.1305/NDJFL/1040046140},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ndjfl/UrquhartF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/Urquhart96,
author = {Alasdair Urquhart},
title = {Duality for algebras of relevant logics},
journal = {Stud Logica},
volume = {56},
number = {1/2},
pages = {263--276},
year = {1996},
url = {https://doi.org/10.1007/BF00370149},
doi = {10.1007/BF00370149},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/Urquhart96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/Urquhart95,
author = {Alasdair Urquhart},
title = {The complexity of propositional proofs},
journal = {Bull. Symb. Log.},
volume = {1},
number = {4},
pages = {425--467},
year = {1995},
url = {https://doi.org/10.2307/421131},
doi = {10.2307/421131},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/Urquhart95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PitassiU95,
author = {Toniann Pitassi and
Alasdair Urquhart},
title = {The Complexity of the Hajos Calculus},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {464--483},
year = {1995},
url = {https://doi.org/10.1137/S089548019224024X},
doi = {10.1137/S089548019224024X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PitassiU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ImpagliazzoPU94,
author = {Russell Impagliazzo and
Toniann Pitassi and
Alasdair Urquhart},
title = {Upper and Lower Bounds for Tree-Like Cutting Planes Proofs},
booktitle = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
{(LICS} '94), Paris, France, July 4-7, 1994},
pages = {220--228},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/LICS.1994.316069},
doi = {10.1109/LICS.1994.316069},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ImpagliazzoPU94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/CookU93,
author = {Stephen A. Cook and
Alasdair Urquhart},
title = {Functional Interpretations of Feasibly Constructive Arithmetic},
journal = {Ann. Pure Appl. Log.},
volume = {63},
number = {2},
pages = {103--200},
year = {1993},
url = {https://doi.org/10.1016/0168-0072(93)90044-E},
doi = {10.1016/0168-0072(93)90044-E},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/CookU93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/Urquhart93,
author = {Alasdair Urquhart},
title = {Failure of interpolation in relevant logics},
journal = {J. Philos. Log.},
volume = {22},
number = {5},
pages = {449--479},
year = {1993},
url = {https://doi.org/10.1007/BF01349560},
doi = {10.1007/BF01349560},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/Urquhart93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Urquhart92,
author = {Alasdair Urquhart},
title = {The Relative Complexity of Resolution and Cut-Free Gentzen Systems},
journal = {Ann. Math. Artif. Intell.},
volume = {6},
number = {1-3},
pages = {157--168},
year = {1992},
url = {https://doi.org/10.1007/BF01531026},
doi = {10.1007/BF01531026},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/Urquhart92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BellantoniPU92,
author = {Stephen J. Bellantoni and
Toniann Pitassi and
Alasdair Urquhart},
title = {Approximation and Small-Depth Frege Proofs},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {6},
pages = {1161--1179},
year = {1992},
url = {https://doi.org/10.1137/0221068},
doi = {10.1137/0221068},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BellantoniPU92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PitassiU92,
author = {Toniann Pitassi and
Alasdair Urquhart},
title = {The Complexity of the Haj{\'{o}}s Calculus},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {187--196},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267773},
doi = {10.1109/SFCS.1992.267773},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PitassiU92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BellantoniPU91,
author = {Stephen J. Bellantoni and
Toniann Pitassi and
Alasdair Urquhart},
title = {Approximation and Small Depth Frege Proofs},
booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
Chicago, Illinois, USA, June 30 - July 3, 1991},
pages = {367--390},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SCT.1991.160281},
doi = {10.1109/SCT.1991.160281},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BellantoniPU91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/CzelakowskiUWWS90,
author = {Janusz Czelakowski and
Alasdair Urquhart and
Ryszard W{\'{o}}jcicki and
Jan Wolenski and
Andrzej Sendlewski and
Marcin Mostowski},
title = {Books received},
journal = {Stud Logica},
volume = {49},
number = {1},
pages = {151--161},
year = {1990},
url = {https://doi.org/10.1007/BF00401560},
doi = {10.1007/BF00401560},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/CzelakowskiUWWS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Urquhart89,
author = {Alasdair Urquhart},
title = {The Complexity of Gentzen Systems for Propositional Logic},
journal = {Theor. Comput. Sci.},
volume = {66},
number = {1},
pages = {87--97},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90147-3},
doi = {10.1016/0304-3975(89)90147-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Urquhart89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CookU89,
author = {Stephen A. Cook and
Alasdair Urquhart},
editor = {David S. Johnson},
title = {Functional Interpretations of Feasibly Constructive Arithmetic (Extended
Abstract)},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {107--112},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73017},
doi = {10.1145/73007.73017},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CookU89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/MeyerMGU88,
author = {Robert K. Meyer and
Errol P. Martin and
Steve Giambrone and
Alasdair Urquhart},
title = {Further Results on Proof Theories For Semilattice Logics},
journal = {Math. Log. Q.},
volume = {34},
number = {4},
pages = {301--304},
year = {1988},
url = {https://doi.org/10.1002/malq.19880340404},
doi = {10.1002/MALQ.19880340404},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/MeyerMGU88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Urquhart87,
author = {Alasdair Urquhart},
title = {Hard examples for resolution},
journal = {J. {ACM}},
volume = {34},
number = {1},
pages = {209--219},
year = {1987},
url = {https://doi.org/10.1145/7531.8928},
doi = {10.1145/7531.8928},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Urquhart87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/GiambroneMU87,
author = {Steve Giambrone and
Robert K. Meyer and
Alasdair Urquhart},
title = {A Contractionless Semilattice Semantics},
journal = {J. Symb. Log.},
volume = {52},
number = {2},
pages = {526--529},
year = {1987},
url = {https://doi.org/10.2307/2274399},
doi = {10.2307/2274399},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/GiambroneMU87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/GiambroneU87,
author = {Steve Giambrone and
Alasdair Urquhart},
title = {Proof Theories for Semilattice Logics},
journal = {Math. Log. Q.},
volume = {33},
number = {5},
pages = {433--439},
year = {1987},
url = {https://doi.org/10.1002/malq.19870330507},
doi = {10.1002/MALQ.19870330507},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/GiambroneU87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Urquhart84,
author = {Alasdair Urquhart},
title = {The Undecidability of Entailment and Relevant Implication},
journal = {J. Symb. Log.},
volume = {49},
number = {4},
pages = {1059--1073},
year = {1984},
url = {https://doi.org/10.2307/2274261},
doi = {10.2307/2274261},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Urquhart84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/Urquhart81,
author = {Alasdair Urquhart},
title = {Decidability and the finite model property},
journal = {J. Philos. Log.},
volume = {10},
number = {3},
pages = {367--370},
year = {1981},
url = {https://doi.org/10.1007/BF00293428},
doi = {10.1007/BF00293428},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/Urquhart81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Urquhart74,
author = {Alasdair Urquhart},
title = {Implicational Formulas in Intuitionistic Logic},
journal = {J. Symb. Log.},
volume = {39},
number = {4},
pages = {661--664},
year = {1974},
url = {https://doi.org/10.2307/2272850},
doi = {10.2307/2272850},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Urquhart74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jphil/Urquhart73,
author = {Alasdair Urquhart},
title = {A semantical theory of analytic implication},
journal = {J. Philos. Log.},
volume = {2},
number = {2},
pages = {212--219},
year = {1973},
url = {https://doi.org/10.1007/BF00263359},
doi = {10.1007/BF00263359},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jphil/Urquhart73.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Urquhart72,
author = {Alasdair Urquhart},
title = {Semantics for Relevant Logics},
journal = {J. Symb. Log.},
volume = {37},
number = {1},
pages = {159--169},
year = {1972},
url = {https://doi.org/10.2307/2272559},
doi = {10.2307/2272559},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Urquhart72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22: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:
