scientific article; zbMATH DE number 1860672

zbMath1013.03070MaRDI QIDQ4790400

Alasdair Urquhart

Publication date: 15 May 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveypropositional logiccomplexity of propositional proof systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items (2)

The decidability of the intensional fragment of classical linear logic ⋮ A Logical Autobiography

This page was built for publication: