The following pages link to Alasdair Urquhart (Q647404):
Displayed 43 items.
- Proof Theories for Semilattice Logics (Q3751556) (← links)
- A contractionless semilattice semantics (Q3762287) (← links)
- Hard examples for resolution (Q3780485) (← links)
- Projective distributive <i>p</i>-algebras (Q3912634) (← links)
- (Q3960819) (← links)
- (Q4010371) (← links)
- Approximation and Small-Depth Frege Proofs (Q4027856) (← links)
- (Q4035305) (← links)
- An Interpretation of Many-Valued Logic (Q4055959) (← links)
- Implicational formulas in intuitionistic logic (Q4077986) (← links)
- (Q4172039) (← links)
- (Q4230340) (← links)
- (Q4250047) (← links)
- (Q4325784) (← links)
- (Q4342080) (← links)
- (Q4376497) (← links)
- (Q4390867) (← links)
- (Q4630790) (← links)
- (Q4789456) (← links)
- (Q4790400) (← links)
- (Q4817185) (← links)
- The Complexity of the Hajós Calculus (Q4847367) (← links)
- The Complexity of Propositional Proofs (Q4873893) (← links)
- Henry M. Sheffer and Notational Relativity (Q4914196) (← links)
- (Q4944927) (← links)
- The complexity of decision procedures in relevance logic II (Q4948542) (← links)
- Ehrenfeucht-Fraïssé games without identity (Q4997579) (← links)
- A Logical Autobiography (Q5027230) (← links)
- Comments on the Contributions (Q5027252) (← links)
- (Q5100012) (← links)
- The complexity of analytic tableaux (Q5175990) (← links)
- Relevant Implication and Ordered Geometry (Q5205988) (← links)
- 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 (Q5245975) (← links)
- RUSSELL AND GÖDEL (Q5283450) (← links)
- 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 (Q5346705) (← links)
- Betweenness and Comparability Obtained from Binary Relations (Q5459179) (← links)
- (Q5636857) (← links)
- Completeness of weak implication (Q5648339) (← links)
- Semantics for relevant logics (Q5656747) (← links)
- The Complexity of Propositional Proofs with the Substitution Rule (Q5697716) (← links)
- Geometry of Relevant Implication II (Q5889056) (← links)
- Theory and Applications of Models of Computation (Q5898862) (← links)
- Relational Methods in Computer Science (Q5899305) (← links)