Double-exponential inseparability of Robinson subsystem Q+ (Q3083130): Difference between revisions

@@ Property / cites work @@
+A Decision Procedure for the First Order Theory of Real Addition with Order
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+The complexity of logical theories
@@ Property / cites work: The complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+Q5570212
@@ Property / cites work: Q5570212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996675
@@ Property / cites work: Q3996675 / rank @@
+Normal rank
@@ Property / cites work @@
+Classifying the computational complexity of problems
+Normal rank
@@ Property / cites work @@
+A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of logical theories
@@ Property / cites work: The computational complexity of logical theories / rank @@
+Normal rank

Double-exponential inseparability of Robinson subsystem <i>Q</i><sub>+</sub> (Q3083130): Difference between revisions