Rules with parameters in modal logic. II. (Q2004954): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4723713
@@ Property / cites work: Q4723713 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128959
@@ Property / cites work: Q3128959 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing queries with higher-order logics
@@ Property / cites work: Computing queries with higher-order logics / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of admissible rules
@@ Property / cites work: Complexity of admissible rules / rank @@
+Normal rank
@@ Property / cites work @@
+Canonical rules
@@ Property / cites work: Canonical rules / rank @@
+Normal rank
@@ Property / cites work @@
+Substitution Frege and extended Frege proof systems in non-classical logics
+Normal rank
@@ Property / cites work @@
+Rules with parameters in modal logic. I.
@@ Property / cites work: Rules with parameters in modal logic. I. / rank @@
+Normal rank
@@ Property / cites work @@
+Truth definitions in finite models
@@ Property / cites work: Truth definitions in finite models / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank