Proof complexity of intuitionistic implicational formulas (Q331054): Difference between revisions

@@ Property / DOI @@
-.1016/j.apal.2016.09.003
@@ Property / DOI: 10.1016/j.apal.2016.09.003 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05667
@@ Property / arXiv ID: 1512.05667 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraizable logics
@@ Property / cites work: Algebraizable logics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3934450
@@ Property / cites work: Q3934450 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the disjunction and existential properties in intuitionistic logic
+Normal rank
@@ Property / cites work @@
+On the computational content of intuitionistic propositional proofs
+Normal rank
@@ Property / cites work @@
+Q3128959
@@ Property / cites work: Q3128959 / rank @@
+Normal rank
@@ Property / cites work @@
+Admissible rules in the implication-negation fragment of intuitionistic logic
+Normal rank
@@ Property / cites work @@
+The separation theorem of intuitionist propositional calculus
+Normal rank
@@ Property / cites work @@
+Lower bounds for modal logics
@@ Property / cites work: Lower bounds for modal logics / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for intuitionistic logic
@@ Property / cites work: A lower bound for intuitionistic logic / rank @@
+Normal rank
@@ Property / cites work @@
+On lengths of proofs in non-classical logics
@@ Property / cites work: On lengths of proofs in non-classical logics / rank @@
+Normal rank
@@ Property / cites work @@
+Frege systems for extensible modal logics
@@ Property / cites work: Frege systems for extensible modal logics / rank @@
+Normal rank
@@ Property / cites work @@
+Substitution Frege and extended Frege proof systems in non-classical logics
+Normal rank
@@ Property / cites work @@
+Positive Formulas in Intuitionistic and Minimal Logic
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Q5460922
@@ Property / cites work: Q5460922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3924171
@@ Property / cites work: Q3924171 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.APAL.2016.09.003
@@ Property / DOI: 10.1016/J.APAL.2016.09.003 / rank @@
+Normal rank