Contribution à l'étude d'une conjecture de théorie des nombres par le codage ZBV. (Contribution to the study of a conjecture of number theory by ZBV coding)
type: Item
instance of: scholarly article
title: Contribution à l'étude d'une conjecture de théorie des nombres par le codage ZBV. (Contribution to the study of a conjecture of number theory by ZBV coding)
zbMATH Open document ID: 0685.03039
author: Serge Grigorieff
author: D. Richard
published in: L'Enseignement Mathématique. 2e Série
publication date: 1989-01-01T00:00:00Z
review text: The paper is devoted to the problem formulated by \textit{J. Robinson} in ``Definability and decision problems in arithmetic'' [J. Symb. Logic 14, 98-114 (1949; Zbl 0034.008)]: can the first order arithmetic of natural numbers be defined in terms of the successor function S and the coprimeness relation \(\perp\). There are several results of J. Robinson and D. Richard, respectively, which show that the arithmetic is definable in terms of S, \(\perp\) and one of the following relations: \(x<y\); \(x+y=z\); \(x| y\); \(x\times y=z\), \(y=m^ x\) (for any fixed \(m\geq 2)\). It turns out that the question of J. Robinson is connected with some open problems in number theory. The aim of the reviewed paper is to present some results from number theory which can be useful to develop methods relevant to mathematical logic, to give a survey of results concerning arithmetical definability and to show that there are more relations which together with S and \(\perp\) suffice to define arithmetic, namely RES(x,y), which means that p is prime and x is a quadratic residue modulo p, and POW(y,x), meaning that y is a power of x, as well as weak restrictions of addition, multiplication and division.
reviewed by: Roman Murawski
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 4121990
zbMATH Keywords: Robinson problem
zbMATH Keywords: coding
zbMATH Keywords: coprimeness relation
zbMATH Keywords: arithmetical definability
MaRDI profile type: Publication
Recommended article: Q3714077
Recommended article: Q3834042
Recommended article: Q3701419
Recommended article: Q4735188
Recommended article: Q3768866
Recommended article: Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
Recommended article: Q3218118
Recommended article: Q4717487
Recommended article: Q3981173
Recommended article: All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
description: scientific article; zbMATH DE number 4121990