On Decidability Within the Arithmetic of Addition and Divisibility
نویسندگان
چکیده
The arithmetic of natural numbers with addition and divisibility has been shown undecidable as a consequence of the fact that multiplication of natural numbers can be interpreted into this theory, as shown by J. Robinson [Rob49]. The most important decidable subsets of the arithmetic of addition and divisibility are the arithmetic of addition, proved by M. Presburger [Pre29], and the purely existential subset, proved by L. Lipshitz [Lip76]. In this paper we define a new decidable fragment of the form QzQ1x1 . . . Qnxnφ(x, z) where the only variable allowed to occur to the left of the divisibility sign is z. For this form, called L | in the paper, we show the existence of a quantifier elimination procedure which always leads to formulas of Presburger arithmetic. We generalize the L | form to ∃z1, . . .∃zmQ1x1 . . . Qnxnφ(x, z), where the only variables appearing on the left of divisibility are z1, . . . , zm. For this form, called ∃L | , we show decidability of the positive fragment, namely by reduction to the existential theory of the arithmetic with addition and divisibility. The L | , ∃L (∗) | fragments were inspired by a real application in the field of program verification. We considered the satisfiability problem for a program logic used for quantitative reasoning about memory shapes, in the case where each record has at most one pointer field. The reduction of this problem to the positive subset of ∃L | is sketched in the end of the paper.
منابع مشابه
Decision problems in Algebra and analogues of Hilbert’s tenth problem
Contents: 1. Part A: Decidability results 1a. Presburger arithmetic 1b. Addition and divisibility 1c. Addition and exponentiation 1d. The analogue of Hilbert's tenth problem for algebraic groups 1e. The results of Ax for 'almost all primes' 1f. Model-completeness 1g. Complete theories 1h. Power-series and germs of analytic functions: existential decidability and Artin approximation 1i. Positive...
متن کاملOn parametric timed automata and one-counter machines
Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed automata in the seminal paper [2]. Their main results are that reachability is decidable for timed automata with a single parametric clock, and undecidable for timed automata with three or more parametric clocks. In the case of two parametric clocks, decidability was left open, with hardly any p...
متن کاملA Restricted Class of 1-register Machines Presburger Arithmetic with Divisibility Veriication Example: Timing-based Mutual Exclusion Symbolic Computation Computing Consistent Parameter Valuations 3.1 a Decidability Result
New decidability results concerning two-way counter machines and applications. 15 machine instruction that adds (or subtracts) the input variable a to the register corresponds, then, to a transition labeled with (y = a; y := 0) (or (x = a; x := 0), respectively). Transition labels of the form (x y), for 2 f=; <; >g, which correspond to test instructions, can be eliminated by duplicating each st...
متن کاملMinimization of semilinear automata
We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount-ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear transition function. The main results is a minimization procedure for semilinear automata. The proof is subtle and refers to decidability of existential Presbu...
متن کاملON MODALITY AND DIVISIBILITY OF POISSON AND BINOMIAL MIXTURES
Some structural aspects of mixtures, in general, have been previously investigated by the author in [I] and [2]. The aim of this article is to investigate some important structural properties of the special cases of Poisson and binomial mixtures in detail. Some necessary and sufficient conditions are arrived at for different modality and divisibility properties of a Poisson mixture based o...
متن کامل