The DOI matches its Crossref record.
A Decision Method for Elementary Algebra and Geometry
Open accessAbstract
By a decision method for a class K of sentence (or other expressions) is meant a method by means of which, given any sentence θ, one can always decide in a finite number of steps whether θ is in K; by a decision problem for a class K we mean the problem of finding a decision method for K. A decision method must be like a recipe, which tells one what to do at each steps so that no intelligence is required to follow it; and the method can be applied by anyone so long as he is able to read and follow directions.
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
Cited by
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
Chapter 13 Qualitative Spatial Representation and Reasoning
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)03013-1 · Cited by 361
Beyond Bell's theorem: correlation scenarios
Fritz, T. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/10/103001 · Cited by 243
Metadata
- Authors
- Tarski, A.
- Venue
- Texts and Monographs in Symbolic Computation
- Publisher
- Springer Vienna
- Published
- 1998
- Pages
- 24-84
- ISSN
- 0943-853X (ISSN-L)
- OpenAlex
- W1553142094
- Cited by
- 1,643
- References
- 0
- FWCI
- 120.53
- Type
- book chapter
- Language
- en
- Open access
- green
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: A Decision Method for Elementary Algebra and Geometry. https://app.cochat.ai/papers/10.1007/978-3-7091-9459-1_3
- The paper
- Tarski, A. (1998). A Decision Method for Elementary Algebra and Geometry. Texts and Monographs in Symbolic Computation. https://doi.org/10.1007/978-3-7091-9459-1_3
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.
