Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T14:56:05.561Z Has data issue: false hasContentIssue false

Undecidable extensions of Skolem arithmetic

Published online by Cambridge University Press:  12 March 2014

Alexis Bès
Affiliation:
Equipe de Logique, Université Paris 7, 2, Place Jussieu, 75251 Paris Cedex 05, France, E-mail: bes@logique.jussieu.fr
Denis Richard
Affiliation:
Laboratoire de Logique, Algorithmique, et Informatique de Clermont I (LLAIC 1), I. U. T. Informatique, B. P. 86, F-63172 Aubière Cedex, France, E-mail: richard@llaic.u-clermontl.fr

Abstract

Let be the restriction of usual order relation to integers which are primes or squares of primes, and let ⊥ denote the coprimeness predicate. The elementary theory of is undecidable. Now denote by <π the restriction of order to primary numbers. All arithmetical relations restricted to primary numbers are definable in the structure (ℕ; ⊥, <π). Furthermore, the structures (ℕ; ∣, <π) (ℕ; =, ×, <π) and (ℕ; =, +, ×) are interdefinable.

Résumé

Résumé

Soit la restriction de l'ordre usuel aux entiers qui sont premiers ou carrés de premiers, et soit ⊥ le prédicat de coprimarité. La théorie élémentaire de est indécidable. Soit maintenant <π l'ordre restreint aux entiers primaires. Toute relation arithmétique restreinte aux entiers primaires est définissable dans la structure (ℕ; ⊥, <π). De plus, les structures (ℕ; ∣, <π) (ℕ; =, ×, <π) et (ℕ; =, +, ×) sont inter-définissables.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable