Alasdair Urquhart

From MaRDI portal
Person:647404

Available identifiers

zbMath Open urquhart.alasdairDBLPu/AlasdairUrquhartWikidataQ4708449 ScholiaQ4708449MaRDI QIDQ647404

List of research outcomes





PublicationDate of PublicationType
Geometry of Relevant Implication II2023-04-26Paper
https://portal.mardi4nfdi.de/entity/Q51000122022-08-26Paper
A Logical Autobiography2022-02-04Paper
Comments on the Contributions2022-02-04Paper
Ehrenfeucht-Fraïssé games without identity2021-06-29Paper
The Story of $$\gamma $$ γ2020-08-07Paper
Relevant Implication and Ordered Geometry2019-12-17Paper
https://portal.mardi4nfdi.de/entity/Q46307902019-04-23Paper
RUSSELL AND GÖDEL2017-07-21Paper
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 …2017-05-26Paper
https://portal.mardi4nfdi.de/entity/Q29665162017-03-07Paper
Pavel Pudlák.Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction. Springer Monographs in Mathematics. Springer, 2013. ISBN: 978-3-319-00118-0 (hbk); 978-3-319-00119-7 (ebook). Pp. xiv + 6952017-03-03Paper
Mathematical Depth2017-03-03Paper
https://portal.mardi4nfdi.de/entity/Q34666342016-02-01Paper
SEBASTIEN GANDON. Russell's Unknown Logicism: A Study in the History and Philosophy of Mathematics. New York: Palgrave Macmillan, 2012. ISBN 978-0-230-57699-5. Pp. xiv + 2662015-04-17Paper
The complexity of analytic tableaux2015-02-27Paper
https://portal.mardi4nfdi.de/entity/Q29310862014-11-23Paper
Failure of interpolation in constant domain intuitionistic logic2014-01-07Paper
Henry M. Sheffer and Notational Relativity2013-04-18Paper
Width and size of regular resolution proofs2012-06-01Paper
The depth of resolution proofs2011-11-23Paper
https://portal.mardi4nfdi.de/entity/Q30027812011-05-24Paper
A Near-Optimal Separation of Regular and General Resolution2011-05-17Paper
https://portal.mardi4nfdi.de/entity/Q30816202011-03-09Paper
https://portal.mardi4nfdi.de/entity/Q30796902011-03-02Paper
Von Neumann, Gödel and Complexity Theory2011-01-13Paper
Anderson and Belnap's invitation to sin2010-10-06Paper
An exponential separation between regular and general resolution2010-08-05Paper
https://portal.mardi4nfdi.de/entity/Q31816502009-10-12Paper
Enumerating Types of Boolean Functions2009-09-29Paper
Supervaluation fixed-point logics of truth2009-07-13Paper
Four variables suffice2009-05-27Paper
Formalizing Dangerous SAT Encodings2009-03-10Paper
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space2009-03-05Paper
Regular and General Resolution: An Improved Separation2008-05-27Paper
Betweenness and Comparability Obtained from Binary Relations2008-04-24Paper
Synonymous logics: a correction2008-04-09Paper
Width versus size in resolution proofs2007-09-28Paper
Relational Methods in Computer Science2007-05-02Paper
Theory and Applications of Models of Computation2007-04-30Paper
The complexity of analytic tableaux2006-11-29Paper
The Complexity of Propositional Proofs with the Substitution Rule2005-10-18Paper
Matrix identities and the pigeonhole principle2004-12-16Paper
https://portal.mardi4nfdi.de/entity/Q48171852004-09-22Paper
Synonymous logics2003-08-21Paper
https://portal.mardi4nfdi.de/entity/Q47904002003-05-15Paper
Resolution proofs of matching principles2003-03-10Paper
https://portal.mardi4nfdi.de/entity/Q47894562003-01-29Paper
https://portal.mardi4nfdi.de/entity/Q42303402002-01-21Paper
https://portal.mardi4nfdi.de/entity/Q27211822001-07-01Paper
https://portal.mardi4nfdi.de/entity/Q49449272000-08-02Paper
The complexity of decision procedures in relevance logic II2000-06-28Paper
The symmetry rule in propositional logic2000-02-14Paper
https://portal.mardi4nfdi.de/entity/Q42500471999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q43908671999-05-16Paper
The number of lines in Frege proofs with substitution1998-08-19Paper
The graph constructions ofHaj�s and Ore1998-04-08Paper
Simplified lower bounds for propositional proofs1997-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43420801997-07-08Paper
The relative complexity of resolution and cut-free Gentzen systems1997-05-13Paper
The Complexity of Propositional Proofs1996-09-09Paper
Duality for algebras of relevant logics1996-08-22Paper
The Complexity of the Hajós Calculus1996-03-18Paper
https://portal.mardi4nfdi.de/entity/Q43257841995-11-28Paper
Decision problems for distributive lattice-ordered semigroups1995-05-30Paper
Failure of interpolation in relevant logics1993-12-09Paper
Functional interpretations of feasibly constructive arithmetic1993-10-13Paper
https://portal.mardi4nfdi.de/entity/Q40353051993-05-18Paper
Approximation and Small-Depth Frege Proofs1993-03-09Paper
https://portal.mardi4nfdi.de/entity/Q40103711992-09-27Paper
The complexity of Gentzen systems for propositional logic1989-01-01Paper
Further Results on Proof Theories For Semilattice Logics1988-01-01Paper
Hard examples for resolution1987-01-01Paper
Proof Theories for Semilattice Logics1987-01-01Paper
A contractionless semilattice semantics1987-01-01Paper
The undecidability of entailment and relevant implication1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32221651983-01-01Paper
Equational classes of distributive double p-algebras1982-01-01Paper
Distributive lattices with a dual homomorphic operation. II1981-01-01Paper
Decidability and the finite model property1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39608191981-01-01Paper
Projective distributive p-algebras1981-01-01Paper
Distributive lattices with a dual homomorphic operation1979-01-01Paper
A topological representation theory for lattices1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41720391977-01-01Paper
Implicational formulas in intuitionistic logic1975-01-01Paper
Free Heyting algebras1973-01-01Paper
A semantical theory of analytic implication1973-01-01Paper
An Interpretation of Many-Valued Logic1973-01-01Paper
Free distributive pseudo-complemented lattices1973-01-01Paper
Semantics for relevant logics1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56368571971-01-01Paper
Completeness of weak implication1971-01-01Paper

Research outcomes over time

This page was built for person: Alasdair Urquhart