Positive existential Definability with unit, addition and coprimeness
From MaRDI portal
Cites work
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- A list of arithmetical structures complete with respect to the first-order definability
- A proof of Bel'tyukov-Lipshitz theorem by quasi-quantifier elimination. I: Definitions and GCD-lemma
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Complexity of Subcases of Presburger Arithmetic
- Definability and decision problems in arithmetic
- Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
- Foundations of Software Science and Computational Structures
- scientific article; zbMATH DE number 3763923 (Why is no real title available?)
- scientific article; zbMATH DE number 3782959 (Why is no real title available?)
- scientific article; zbMATH DE number 3537666 (Why is no real title available?)
- In memoriam of Alan Robert Woods
- Linear problems in valued fields
- On the Chinese Remainder Theorem
- On the complexity of linear arithmetic with divisibility
- Reachability in Succinct and Parametric One-Counter Automata
- Synthesis problems for one-counter automata
- The complexity of linear problems in fields
- The Diophantine Problem for Addition and Divisibility
- The laws of integer divisibility, and solution sets of linear divisibility conditions
- Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
Cited in
(2)
This page was built for publication: Positive existential Definability with unit, addition and coprimeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666557)
