Definability and decidability issues in extensions of the integers with the divisibility predicate (Q4894724): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2307/2275673
@@ Property / full work available at URL: https://doi.org/10.2307/2275673 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2030664340
@@ Property / OpenAlex ID: W2030664340 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56896689
@@ Property / Wikidata QID: Q56896689 / 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 @@
+Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+Recognition and parsing of context-free languages in time n3
+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