The following pages link to Alasdair Urquhart (Q647404):
Displayed 50 items.
- The depth of resolution proofs (Q647405) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Failure of interpolation in relevant logics (Q689074) (← links)
- Matrix identities and the pigeonhole principle (Q701728) (← links)
- Supervaluation fixed-point logics of truth (Q1029817) (← links)
- Distributive lattices with a dual homomorphic operation (Q1135295) (← links)
- Decidability and the finite model property (Q1154458) (← links)
- Equational classes of distributive double p-algebras (Q1163580) (← links)
- A topological representation theory for lattices (Q1247989) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- The relative complexity of resolution and cut-free Gentzen systems (Q1353988) (← links)
- Simplified lower bounds for propositional proofs (Q1374208) (← links)
- The number of lines in Frege proofs with substitution (Q1386671) (← links)
- Synonymous logics (Q1404389) (← links)
- Distributive lattices with a dual homomorphic operation. II (Q1838987) (← links)
- Resolution proofs of matching principles (Q1861903) (← links)
- Decision problems for distributive lattice-ordered semigroups (Q1891276) (← links)
- Duality for algebras of relevant logics (Q1914154) (← links)
- Anderson and Belnap's invitation to sin (Q1959326) (← links)
- The symmetry rule in propositional logic (Q1961453) (← links)
- Free Heyting algebras (Q2264689) (← links)
- Free distributive pseudo-complemented lattices (Q2264780) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- Synonymous logics: a correction (Q2481245) (← links)
- A semantical theory of analytic implication (Q2562073) (← links)
- (Q2721182) (← links)
- Failure of Interpolation in Constant Domain Intuitionistic Logic (Q2869908) (← links)
- Width and size of regular resolution proofs (Q2888509) (← links)
- (Q2931086) (← links)
- <b>Pavel Pudlák.<i>Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction</i></b>. Springer Monographs in Mathematics. Springer, 2013. ISBN: 978-3-319-00118-0 (hbk); 978-3-319-00119-7 (ebook). Pp. xiv + 695 (Q2965634) (← links)
- Mathematical Depth (Q2965640) (← links)
- (Q2966516) (← links)
- A Near-Optimal Separation of Regular and General Resolution (Q2999857) (← links)
- (Q3002781) (← links)
- Further Results on Proof Theories For Semilattice Logics (Q3030795) (← links)
- Von Neumann, Gödel and Complexity Theory (Q3067861) (← links)
- (Q3079690) (← links)
- (Q3081620) (← links)
- (Q3181650) (← links)
- (Q3222165) (← links)
- The Story of $$\gamma $$ γ (Q3305422) (← links)
- Enumerating Types of Boolean Functions (Q3398615) (← links)
- The complexity of analytic tableaux (Q3410672) (← links)
- (Q3466634) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- An exponential separation between regular and general resolution (Q3579185) (← links)
- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space (Q3608436) (← links)
- Formalizing Dangerous SAT Encodings (Q3612464) (← links)
- (Q3629230) (← links)
- The undecidability of entailment and relevant implication (Q3703869) (← links)