Alasdair Urquhart

73 papers A* 5A 2B 2C 1Journal 57Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Formulas of one variable in KR. Australas. J. Log. Alasdair Urquhart
2025	J	`jnl`	Failure of Beth's Theorem in Relevance Logics. Rev. Symb. Log. Alasdair Urquhart
2023	J	`jnl`	Geometry of Relevant Implication II. Australas. J. Log. Alasdair Urquhart
2021	J	`jnl`	Ehrenfeucht-Fraïssé games without identity. Australas. J. Log. Alasdair Urquhart
2019	J	`jnl`	Relevant Implication and Ordered Geometry. Australas. J. Log. Alasdair Urquhart
2017	J	`jnl`	The Geometry of Relevant Implication. FLAP Alasdair Urquhart
2016	J	`jnl`	Relevance Logic: Problems Open and Closed. Australas. J. Log. Alasdair Urquhart
2016	J	`jnl`	Russell and Gödel. Bull. Symb. Log. Alasdair Urquhart
2016	J	`jnl`	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. Alasdair Urquhart
2015	J	`jnl`	First degree formulas in quantified S5. Australas. J. Log. Alasdair Urquhart
2013	J	`jnl`	Failure of interpolation in constant domain intuitionistic logic. J. Symb. Log. Grigori Mints, Grigory K. Olkhovikov, Alasdair Urquhart
2012	J	`jnl`	Width and size of regular resolution proofs Log. Methods Comput. Sci. Alasdair Urquhart
2011	J	`jnl`	A Near-Optimal Separation of Regular and General Resolution. SIAM J. Comput. Alasdair Urquhart
2011	J	`jnl`	The Depth of Resolution Proofs. Stud Logica Alasdair Urquhart
2010	J	`jnl`	Anderson and Belnap's Invitation to Sin. J. Philos. Log. Alasdair Urquhart
2010	—	`ch.`	Proof Theory. Boolean Models and Methods Alasdair Urquhart, Yves Crama, Peter L. Hammer
2010	J	`jnl`	Von Neumann, Gödel and complexity theory. Bull. Symb. Log. Alasdair Urquhart
2009	J	`jnl`	Algorithms and Complexity Results for Input and Unit Resolution. J. Satisf. Boolean Model. Comput. Alexander Hertel, Alasdair Urquhart
2009	J	`jnl`	Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. Alexander Hertel, Alasdair Urquhart
2009	—	`ch.`	Emil Post. Logic from Russell to Church Alasdair Urquhart
2009	J	`jnl`	Enumerating types of Boolean functions. Bull. Symb. Log. Alasdair Urquhart
2008	J	`jnl`	Mathematical Methods in Philosophy Editors' Introduction. Rev. Symb. Log. Aldo Antonelli, Alasdair Urquhart, Richard Zach
2008	A	`conf`	Regular and General Resolution: An Improved Separation. SAT Alasdair Urquhart
2008	J	`jnl`	Supervaluation Fixed-Point Logics of Truth. J. Philos. Log. Philip Kremer, Alasdair Urquhart
2008	J	`jnl`	Synonymous Logics: A Correction. J. Philos. Log. Francis Jeffry Pelletier, Alasdair Urquhart
2007	J	`jnl`	An Exponential Separation between Regular and General Resolution. Theory Comput. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
2007	A	`conf`	Formalizing Dangerous SAT Encodings. SAT Alexander Hertel, Philipp Hertel, Alasdair Urquhart
2007	J	`jnl`	Four Variables Suffice. Australas. J. Log. Alasdair Urquhart
2007	B	`conf`	Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. CSL Alexander Hertel, Alasdair Urquhart
2007	J	`jnl`	Width versus size in resolution proofs. Theor. Comput. Sci. Alasdair Urquhart
2006	—	`conf`	Betweenness and Comparability Obtained from Binary Relations. RelMiCS Ivo Düntsch, Alasdair Urquhart
2006	J	`jnl`	The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. Alexander Hertel, Alasdair Urquhart
2006	J	`jnl`	The complexity of analytic tableaux. J. Symb. Log. Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
2006	C	`conf`	Width Versus Size in Resolution Proofs. TAMC Alasdair Urquhart
2005	—	`conf`	Duality Theory for Projective Algebras. RelMiCS Alasdair Urquhart
2005	J	`jnl`	The Complexity of Propositional Proofs with the Substitution Rule. Log. J. IGPL Alasdair Urquhart
2004	J	`jnl`	Matrix identities and the pigeonhole principle. Arch. Math. Log. Michael Soltys, Alasdair Urquhart
2003	J	`jnl`	Resolution Proofs of Matching Principles. Ann. Math. Artif. Intell. Alasdair Urquhart
2003	J	`jnl`	Synonymous Logics. J. Philos. Log. Francis Jeffry Pelletier, Alasdair Urquhart
2002	A*	`conf`	An exponential separation between regular and general resolution. STOC Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
2001	J	`jnl`	An Exponential Separation between Regular and General Resolution Electron. Colloquium Comput. Complex. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
2001	—	`ch.`	The Complexity of Propositional Proofs. Current Trends in Theoretical Computer Science Alasdair Urquhart
2001	A*	`conf`	The complexity of analytic tableaux. STOC Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart
2000	B	`conf`	Local Symmetries in Propositional Logic. TABLEAUX Noriko H. Arai, Alasdair Urquhart
1999	J	`jnl`	The Complexity of Decision Procedures In Relevance Logic II. J. Symb. Log. Alasdair Urquhart
1999	J	`jnl`	The Symmetry Rule in Propositional Logic. Discret. Appl. Math. Alasdair Urquhart
1998	J	`jnl`	The Complexity of Propositional Proofs. Bull. EATCS Alasdair Urquhart
1997	J	`jnl`	Review: Feasible Mathematics II. Log. J. IGPL Alasdair Urquhart
1997	J	`jnl`	The graph constructions of J. Graph Theory Alasdair Urquhart
1997	J	`jnl`	The number of lines in Frege proofs with substitution. Arch. Math. Log. Alasdair Urquhart
1996	J	`jnl`	Duality for algebras of relevant logics. Stud Logica Alasdair Urquhart
1996	J	`jnl`	Simplified Lower Bounds for Propositional Proofs. Notre Dame J. Formal Log. Alasdair Urquhart, Xudong Fu
1995	J	`jnl`	The Complexity of the Hajos Calculus. SIAM J. Discret. Math. Toniann Pitassi, Alasdair Urquhart
1995	J	`jnl`	The complexity of propositional proofs. Bull. Symb. Log. Alasdair Urquhart
1994	A*	`conf`	Upper and Lower Bounds for Tree-Like Cutting Planes Proofs LICS Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart
1993	J	`jnl`	Failure of interpolation in relevant logics. J. Philos. Log. Alasdair Urquhart
1993	J	`jnl`	Functional Interpretations of Feasibly Constructive Arithmetic. Ann. Pure Appl. Log. Stephen A. Cook, Alasdair Urquhart
1992	J	`jnl`	Approximation and Small-Depth Frege Proofs. SIAM J. Comput. Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
1992	A*	`conf`	The Complexity of the Hajós Calculus FOCS Toniann Pitassi, Alasdair Urquhart
1992	J	`jnl`	The Relative Complexity of Resolution and Cut-Free Gentzen Systems. Ann. Math. Artif. Intell. Alasdair Urquhart
1991	—	`conf`	Approximation and Small Depth Frege Proofs. SCT Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
1990	J	`jnl`	Books received. Stud Logica Janusz Czelakowski, Alasdair Urquhart, Ryszard Wójcicki, Jan Wolenski, Andrzej Sendlewski, Marcin Mostowski
1989	A*	`conf`	Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) STOC Stephen A. Cook, Alasdair Urquhart
1989	J	`jnl`	The Complexity of Gentzen Systems for Propositional Logic. Theor. Comput. Sci. Alasdair Urquhart
1988	J	`jnl`	Further Results on Proof Theories For Semilattice Logics. Math. Log. Q. Robert K. Meyer, Errol P. Martin, Steve Giambrone, Alasdair Urquhart
1987	J	`jnl`	A Contractionless Semilattice Semantics. J. Symb. Log. Steve Giambrone, Robert K. Meyer, Alasdair Urquhart
1987	J	`jnl`	Hard examples for resolution. J. ACM Alasdair Urquhart
1987	J	`jnl`	Proof Theories for Semilattice Logics. Math. Log. Q. Steve Giambrone, Alasdair Urquhart
1984	J	`jnl`	The Undecidability of Entailment and Relevant Implication. J. Symb. Log. Alasdair Urquhart
1981	J	`jnl`	Decidability and the finite model property. J. Philos. Log. Alasdair Urquhart
1974	J	`jnl`	Implicational Formulas in Intuitionistic Logic. J. Symb. Log. Alasdair Urquhart
1973	J	`jnl`	A semantical theory of analytic implication. J. Philos. Log. Alasdair Urquhart
1972	J	`jnl`	Semantics for Relevant Logics. J. Symb. Log. Alasdair Urquhart