Undecidable extensions of Skolem arithmetic (Q4212909): Difference between revisions

@@ Property / author @@
-Denis Richard
@@ Property / author: Denis Richard / rank @@
-Normal rank
@@ Property / author @@
+Denis Richard
@@ Property / author: Denis Richard / rank @@
+Normal rank
@@ 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/2586837
@@ Property / full work available at URL: https://doi.org/10.2307/2586837 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2099198433
@@ Property / OpenAlex ID: W2099198433 / rank @@
+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 @@
+All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
+Normal rank
@@ Property / cites work @@
+Definability and decidability issues in extensions of the integers with the divisibility predicate
+Normal rank
@@ Property / cites work @@
+The theory of integer multiplication with order restricted to primes is decidable
+Normal rank
@@ Property / cites work @@
+Q4071794
@@ Property / cites work: Q4071794 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4212909