The theory of integer multiplication with order restricted to primes is decidable
From MaRDI portal
Publication:4338318
DOI10.2307/2275735zbMath0881.03008OpenAlexW2034177508MaRDI QIDQ4338318
Publication date: 28 May 1997
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275735
Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Some new results in monadic second-order arithmetic ⋮ Exact complexity bounds for ordinal addition ⋮ Multitree automata that count ⋮ Undecidable extensions of Skolem arithmetic
Cites Work
- A uniform method for proving lower bounds on the computational complexity of logical theories
- The computational complexity of logical theories
- Weak Second‐Order Arithmetic and Finite Automata
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Definability and decision problems in arithmetic
This page was built for publication: The theory of integer multiplication with order restricted to primes is decidable