Complexity of Logical Theories Involving Coprimality

@article{Michel1992ComplexityOL,
  title={Complexity of Logical Theories Involving Coprimality},
  author={Pascal Michel},
  journal={Theor. Comput. Sci.},
  year={1992},
  volume={106},
  pages={221-241}
}
It is well known that complete number theory, i.e. the theory of the structure (FU, =, +, x ), is undecidable. When we drop one of the operations + or x , the theories Th(N, =, +) and Th(N, =, x) we obtain are decidable [19,16, 251. The computational complexity of these theories has been studied [3,4,8-l 1, 17, 18,20,21], eventually showing that Th( N, =, + ) is complete for uC,0 ATIME-ALT(2”“, n), and Th( N, =, x ) is complete for UC,0 ATIME-ALT(222’M, n) [S]. Many relations and functions can… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Quelques contributions a I’etude des arithmetiques faibles, These d’Etat, Universite Paris 7, and Publ

P. Cegielski
LITP 90.77, • 1990

Theorem - proving in arithmetic without multiplication , Mach

D. C. Cooper
1990

Borne superieure de la complexite de la theorie de N muni de la relation de divisibilite

J.-P. Ressayre
Model Theory und Arithmetic , Lecture Notes in Mathematics • 1988

The Book of‘Prime Number Records (Springer

P. Ribenboim
New York, • 1988

Logical theories of one-place functions on the set of natural numbers, Math. USSRIx

A. L. Semenov
(Russian original: • 1984

Some problems in logic and number theory and their connections, Thesis, University of Manchester

A. Woods
1981

The complexity of logical theories, Theorer

L. Berman
Comput. Sci • 1980

Complexity of Boolean algebras , Theorer

J. E. Hopcroft, J. D. Ullman
Comput . Sci . • 1979

Similar Papers

Loading similar papers…