Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers

E-ISSN： 1943-5886|54|4|1253-1287

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.54, Iss.4, 1989-12, pp. : 1253-1287

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Definability and decidability issues in extensions of the integers with the divisibility predicate

The Journal of Symbolic Logic, Vol. 61, Iss. 2, 1996-06 ,pp. : 515-540

Cambridge University Press

Access to resources Recommend Favorite

Definability with a predicate for a semi-linear set

The Journal of Symbolic Logic, Vol. 68, Iss. 1, 2003-03 ,pp. : 319-351

Cambridge University Press

Access to resources Recommend Favorite

Definability in the monadic second-order theory of successor ¹

The Journal of Symbolic Logic, Vol. 34, Iss. 2, 1969-07 ,pp. : 166-170

Cambridge University Press

Access to resources Recommend Favorite

Definability in models of set theory

The Journal of Symbolic Logic, Vol. 45, Iss. 1, 1980-03 ,pp. : 9-19

Cambridge University Press

Access to resources Recommend Favorite

Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility

The Journal of Symbolic Logic, Vol. 50, Iss. 4, 1985-12 ,pp. : 927-935

Cambridge University Press

Access to resources Recommend Favorite