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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2275735
@@ Property / full work available at URL: https://doi.org/10.2307/2275735 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2034177508
@@ Property / OpenAlex ID: W2034177508 / rank @@
+Normal rank
@@ 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