The DOI matches its Crossref record.
Fixed-point extensions of first-order logic
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Logical Dynamics of Information and Interaction
van Benthem, J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511974533 · Cited by 505
The alternating fixpoint of logic programs with negation
Van Gelder, A. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73722 · Cited by 369
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
Metadata
- Authors
- Gurevich, Y., & Shelah, S.
- Venue
- Annals of Pure and Applied Logic
- Publisher
- Elsevier BV
- Published
- 1986
- Volume
- 32
- Pages
- 265-280
- ISSN
- 0168-0072 (ISSN-L)
- OpenAlex
- W2059144726
- Cited by
- 241
- References
- 0
- FWCI
- 2.77
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Fixed-point extensions of first-order logic. https://app.cochat.ai/papers/10.1016/0168-0072(86)90055-2
- The paper
- Gurevich, Y., & Shelah, S. (1986). Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic. https://doi.org/10.1016/0168-0072(86)90055-2
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.