The theory of integer multiplication with order restricted to primes is decidable (Q4338318): Difference between revisions

@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+Definability and decision problems in arithmetic
@@ Property / cites work: Definability and decision problems in arithmetic / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of logical theories
@@ Property / cites work: The computational complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+A Decision Procedure for the First Order Theory of Real Addition with Order
+Normal rank