The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Definability and decision problems in arithmetic
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 successor S(where Sa=a+ 1). Also, it is shown that both addition and multiplication can be defined arithmetically in terms of successor and the relation of divisibility | (where x|y means x divides y).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
An Unsolvable Problem of Elementary Number Theory
Church, A. (1936) · American Journal of Mathematics · doi:10.2307/2371045 · Cited by 1,763
A note on the Entscheidungsproblem
Church, A. (1936) · Journal of Symbolic Logic · doi:10.2307/2269326 · Cited by 810
Der Wahrheitsbegriff in den formalisierten Sprachen
Tarski, A. (1986) · De Gruyter eBooks · doi:10.1515/9783112645826-016 · Cited by 730
Bernays, P. (1937) · Journal of Symbolic Logic · doi:10.2307/2268833 · Cited by 205
Metadata
- Authors
- Robinson, J.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Published
- 1949-06-23
- Volume
- 14
- Issue
- 2
- Pages
- 98-114
- ISSN
- 0022-4812 (ISSN-L)
- 1943-5886
- OpenAlex
- W2015376829
- Cited by
- 314
- References
- 6
- FWCI
- 22.28
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Definability and decision problems in arithmetic. https://app.cochat.ai/papers/10.2307/2266510
- The paper
- Robinson, J. (1949). Definability and decision problems in arithmetic. Journal of Symbolic Logic. https://doi.org/10.2307/2266510
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.