The Diophantine Problem for Addition and Divisibility

Congruences; primitive roots; residue systems (11A07) Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80) Decidability (number-theoretic aspects) (11U05)

Cites work

scientific article; zbMATH DE number 3121283 (Why is no real title available?)
Definability and decision problems in arithmetic
On the Chinese Remainder Theorem

Cited in

(29)

Undecidable Existential Problems for Addition and Divisibility in Algebraic Number Rings. II
Undecidable Existential Problems for Addition and Divisibility in Algebraic Number Rings
Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
Compositional satisfiability solving in separation logic
A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma
Interpreting arithmetic in the first-order theory of addition and coprimality of polynomial rings
On two-way FA with monotonic counters and quadratic Diophantine equations
On an exponential predicate in polynomials over finite fields
Solvable problems for transformers with reversal-bounded counters
Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
Reachability in Succinct and Parametric One-Counter Automata
The complexity of almost linear diophantine problems
INTERLEAVING LOGIC AND COUNTING
The diophantine problem for addition and divisibility for subrings of rational functions over finite fields
Decidability questions for a ring of Laurent polynomials
Existential decidability for addition and divisibility in holomorphy subrings of global fields
A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. II: The main reduction
The laws of integer divisibility, and solution sets of linear divisibility conditions
Elliptic divisibility sequences and undecidable problems about rational points
NP-complete problems for systems of linear polynomial's values divisibilities
A note on Parikh maps, abstract languages, and decision problems
Positive existential Definability with unit, addition and coprimeness
Decidability of the Existential Theory of the Set of Natural Numbers with Order, Divisibility, Power Functions, Power Predicates, and Constants
Decidability of sub-theories of polynomials over a finite field
On parametric timed automata and one-counter machines
On two-way nondeterministic finite automata with one reversal-bounded counter
A view of computability on term algebras
On the solvability of a class of Diophantine equations and applications
The Diophantine problem for addition and divisibility over subrings of the rationals

This page was built for publication: The Diophantine Problem for Addition and Divisibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152529)