The theory of integer multiplication with order restricted to primes is decidable (Q4338318): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2275735 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034177508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A uniform method for proving lower bounds on the computational complexity of logical theories / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Definability and decision problems in arithmetic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The computational complexity of logical theories / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank | |||
Normal rank | |||
Latest revision as of 11:51, 27 May 2024
scientific article; zbMATH DE number 1014591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The theory of integer multiplication with order restricted to primes is decidable |
scientific article; zbMATH DE number 1014591 |
Statements
The theory of integer multiplication with order restricted to primes is decidable (English)
0 references
28 May 1997
0 references
integer multiplication
0 references
quantifier elimination
0 references
complexity
0 references
tower of exponentials
0 references
0 references
