Undecidable extensions of Skolem arithmetic

Journal of Symbolic Logic 63 (2):379-401 (1998)
  Copy   BIBTEX

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 $\langle\mathbb{N};\bot, , is undecidable. Now denote by $ the restriction of order to primary numbers. All arithmetical relations restricted to primary numbers are definable in the structure $\langle\mathbb{N};\bot, . Furthermore, the structures $\langle\mathbb{N};\mid, and $\langle\mathbb{N};=,+,x\rangle$ are interdefinable

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Undecidable Extensions of Skolem Arithmetic.Alexis Bes & Denis Richard - 1998 - Journal of Symbolic Logic 63 (2):379-401.
The modal logic of {beta(mathbb{N})}.Guram Bezhanishvili & John Harding - 2009 - Archive for Mathematical Logic 48 (3-4):231-242.
Reducts of some structures over the reals.Ya′Acov Peterzil - 1993 - Journal of Symbolic Logic 58 (3):955-966.

Analytics

Added to PP
2009-01-28

Downloads
267 (#100,658)

6 months
20 (#146,291)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

2004 Summer Meeting of the Association for Symbolic Logic.Wolfram Pohlers - 2005 - Bulletin of Symbolic Logic 11 (2):249-312.

Add more citations

References found in this work

No references found.

Add more references