A Logical Autobiography

DOI10.1007/978-3-030-71430-7_1zbMath1484.01030OpenAlexW3204518621MaRDI QIDQ5027230

Alasdair Urquhart

Publication date: 4 February 2022

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-71430-7_1

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of mathematical logic and foundations (03-03)

Cites Work

• Theory and Applications of Models of Computation
• Relational Methods in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The depth of resolution proofs
• Functional interpretations of feasibly constructive arithmetic
• Failure of interpolation in relevant logics
• Matrix identities and the pigeonhole principle
• Supervaluation fixed-point logics of truth
• The intractability of resolution
• Distributive lattices with a dual homomorphic operation
• Decidability and the finite model property
• Equational classes of distributive double p-algebras
• A topological representation theory for lattices
• On the complexity of regular resolution and the Davis-Putnam procedure
• The complexity of Gentzen systems for propositional logic
• Logic at work. Essays dedicated to the memory of Helena Rasiowa
• The relative complexity of resolution and cut-free Gentzen systems
• Simplified lower bounds for propositional proofs
• The number of lines in Frege proofs with substitution
• Synonymous logics
• Distributive lattices with a dual homomorphic operation. II
• Resolution proofs of matching principles
• Decision problems for distributive lattice-ordered semigroups
• Duality for algebras of relevant logics
• Anderson and Belnap's invitation to sin
• The symmetry rule in propositional logic
• Free Heyting algebras
• Free distributive pseudo-complemented lattices
• Synonymous logics: a correction
• The amalgamation property in equational classes of modular lattices
• A semantical theory of analytic implication
• Failure of Interpolation in Constant Domain Intuitionistic Logic
• Width and size of regular resolution proofs
• 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 + 695
• Mathematical Depth
• A Near-Optimal Separation of Regular and General Resolution
• Further Results on Proof Theories For Semilattice Logics
• Von Neumann, Gödel and Complexity Theory
• IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE
• The Story of $$\gamma $$ γ
• Enumerating Types of Boolean Functions
• Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
• Formalizing Dangerous SAT Encodings
• The undecidability of entailment and relevant implication
• Proof Theories for Semilattice Logics
• A contractionless semilattice semantics
• Hard examples for resolution
• Free Modular Lattices
• Projective distributive p-algebras
• Approximation and Small-Depth Frege Proofs
• Implicational formulas in intuitionistic logic
• [https://portal.mardi4nfdi.de/wiki/Publication:4376497 The graph constructions ofHaj�s and Ore]
• The Complexity of the Hajós Calculus
• The Complexity of Propositional Proofs
• Henry M. Sheffer and Notational Relativity
• The complexity of decision procedures in relevance logic II
• The complexity of analytic tableaux
• Relevant Implication and Ordered Geometry
• 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 + 266
• RUSSELL AND GÖDEL
• 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 …
• Betweenness and Comparability Obtained from Binary Relations
• Representation of Distributive Lattices by means of ordered Stone Spaces
• Completeness of weak implication
• Semantics for relevant logics
• The Complexity of Propositional Proofs with the Substitution Rule

This page was built for publication: A Logical Autobiography