Definability and Decision Problems in Arithmetic

title={Definability and Decision Problems in Arithmetic},
author={Julia Jean Robinson},
journal={J. Symb. Log.},
year={1949},
volume={14},
pages={98-114}
}
• J. Robinson
• Published 1 June 1949
• Mathematics, Computer Science
• J. Symb. Log.
In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems. In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of successor S (where Sa = a + 1). Also, it is shown that both addition and multiplication can be defined arithmetically…
314 Citations

Topics from this paper

Some Decidability and Definability Problems for the Predicate of the Divisibility on Two Consecutive Numbers
The predicate of divisibility on two consecutive numbers DW(x,y) ÷ x | y ∧ 1+x | y was introduced by L. van den Dries and A. Wilkie when they studied some properties of subsets of natural numbers,
On Decidability Within the Arithmetic of Addition and Divisibility
• Mathematics, Computer Science
FoSSaCS
• 2005
This paper defines a new decidable fragment of the form QzQ1x1 ...
On the Complexity of Linear Arithmetic with Divisibility
• Computer Science, Mathematics
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
• 2015
It is shown that if an existential sentence of Presburger arithmetic with divisibility is satisfiable then the smallest satisfying assignment has size at most exponential in the size of the formula, showing that the decision problem for such sentences is in NEXPTIME.
On the Power of Ordering in Linear Arithmetic Theories
• Mathematics, Computer Science
ICALP
• 2020
This work establishes a full geometric characterisation of those sets definable without order which in turn enables it to prove coNP-completeness of this problem over the rationals and to establish an elementary upper bound over the integers.
A Reduction in the Number of Primitive Ideas of Arithmetic
• J. Myhill
• Mathematics, Computer Science
J. Symb. Log.
• 1950
Let We shall show that every formula in the elementary arithmetic of positive integers may be constructed out of matrices of the form ϕ ( x, y ) by means of quantifiers and the stroke. For Julia
On Arithmetical First-Order Theories Allowing Encoding and Decoding of Lists
• Computer Science, Mathematics
Theor. Comput. Sci.
• 1999
On the power of ordering inlinear arithmetic theories
We study the problems of deciding whether a relation definable by a first-order formula in linear rational or linear integer arithmetic with an order relation is definable in absence of the order
Interpretability and uniform definability of integers, and undecidability of reduced indecomposable polynomial rings.
• Mathematics
• 2020
We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform
Definability in Terms of the Successor Function and the Coprimeness Predicate in the Set of Arbitrary Integers
Using coding devices based on a theorem due to Zsigmondy, Birkhoff and Vandiver, we first define in terms of successor S and coprimeness predicate L a full arithmetic over the set of powers of some