Definability and decision problems in arithmetic

Journal of Symbolic Logic 14 (2):98-114 (1949)
  Copy   BIBTEX

Abstract

In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems.In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of successorS(whereSa=a+ 1). Also, it is shown that both addition and multiplication can be defined arithmetically in terms of successor and the relation of divisibility | (wherex|ymeansxdividesy).

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
237 (#85,199)

6 months
23 (#119,723)

Historical graph of downloads
How can I increase my downloads?