A Logical Autobiography
From MaRDI portal
Publication:5027230
DOI10.1007/978-3-030-71430-7_1zbMATH Open1484.01030OpenAlexW3204518621MaRDI QIDQ5027230FDOQ5027230
Authors: 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
Recommendations
Biographies, obituaries, personalia, bibliographies (01A70) History of mathematical logic and foundations (03-03)
Cites Work
- Title not available (Why is that?)
- 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
- Relational Methods in Computer Science
- Title not available (Why is that?)
- The complexity of analytic tableaux
- Title not available (Why is that?)
- A topological representation theory for lattices
- Four variables suffice
- The undecidability of entailment and relevant implication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of decision procedures in relevance logic II
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hard examples for resolution
- Title not available (Why is that?)
- The Complexity of Propositional Proofs
- Distributive lattices with a dual homomorphic operation
- The amalgamation property in equational classes of modular lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The intractability of resolution
- Semantics for relevant logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decorated linear order types and the theory of concatenation
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Formalizing Dangerous SAT Encodings
- Implicational formulas in intuitionistic logic
- Title not available (Why is that?)
- Synonymous logics
- Distributive lattices with a dual homomorphic operation. II
- Proof Theories for Semilattice Logics
- Title not available (Why is that?)
- The Complexity of the Hajós Calculus
- Betweenness and Comparability Obtained from Binary Relations
- Functional interpretations of feasibly constructive arithmetic
- Free Modular Lattices
- Duality for algebras of relevant logics
- A near-optimal separation of regular and general resolution
- A contractionless semilattice semantics
- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
- The depth of resolution proofs
- On the complexity of regular resolution and the Davis-Putnam procedure
- The complexity of Gentzen systems for propositional logic
- Title not available (Why is that?)
- The relative complexity of resolution and cut-free Gentzen systems
- Failure of interpolation in constant domain intuitionistic logic
- Approximation and Small-Depth Frege Proofs
- Failure of interpolation in relevant logics
- Matrix identities and the pigeonhole principle
- Free Heyting algebras
- A semantical theory of analytic implication
- The symmetry rule in propositional logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completeness of weak implication
- Logic at work. Essays dedicated to the memory of Helena Rasiowa
- 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 …
- Title not available (Why is that?)
- Supervaluation fixed-point logics of truth
- Title not available (Why is that?)
- Free distributive pseudo-complemented lattices
- Title not available (Why is that?)
- Theory and Applications of Models of Computation
- Relevance logic: problems open and closed
- Further Results on Proof Theories For Semilattice Logics
- Proof theory
- Decidability and the finite model property
- Title not available (Why is that?)
- Equational classes of distributive double p-algebras
- Projective distributive p-algebras
- Simplified lower bounds for propositional proofs
- The number of lines in Frege proofs with substitution
- Title not available (Why is that?)
- Implicational relevance logic is 2-\textsc{ExpTime}-complete
- The graph constructions ofHaj�s and Ore
- Resolution proofs of matching principles
- Decision problems for distributive lattice-ordered semigroups
- Anderson and Belnap's invitation to sin
- Width and size of regular resolution proofs
- Henry M. Sheffer and notational relativity
- Enumerating Types of Boolean Functions
- Synonymous logics: a correction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Russell and Gödel
- Von Neumann, Gödel and complexity theory
- Title not available (Why is that?)
- Mathematical depth
- The Complexity of Propositional Proofs with the Substitution Rule
- The Story of $$\gamma $$ γ
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A Logical Autobiography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027230)