scientific article; zbMATH DE number 2187723
From MaRDI portal
Publication:5460922
zbMath1095.03062MaRDI QIDQ5460922
No author found.
Publication date: 20 July 2005
Full work available at URL: https://eudml.org/doc/224153
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Related Items (7)
Proof complexity of intuitionistic implicational formulas ⋮ A lower bound for intuitionistic logic ⋮ ON NON-MONOTONOUS PROPERTIES OF SOME CLASSICAL AND NONCLASSICAL PROPOSITIONAL PROOF SYSTEMS ⋮ Frege systems for extensible modal logics ⋮ Proof Complexity of Non-classical Logics ⋮ Substitution Frege and extended Frege proof systems in non-classical logics ⋮ On the proof complexity of logics of bounded branching
This page was built for publication:
