CoChat

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

Gödel, Kurt · 1931 · Monatshefte für Mathematik und Physik

Overview

Integrity signals

Registry

Crossref · 10.1007/bf01700692

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 2 references

Research works printed but not linked: 2

  1. A. Whitehead und B. Russell, Principia Mathematica, 2. Aufl., Cambridge 1925. Zu den Axiomen des Systems PM rechnen wir insbesondere auch: Das Unendlichkeitsaxiom (in der Form: es gibt genau abzählbar viele Individuen), das Reduzibilitäts- und das Auswahlaxiom (für alle Typen).
  2. Vgl. J. v. Neumann, Zur Hilbertschen Beweistheorie, Math. Zeitschr. 26, 1927. · DOI · Paper page

Cited by

Items 2,001–2,100 of 2,380

Metadata

Authors
Gödel, K.
Corresponding author
Gödel, Kurt
Venue
Monatshefte für Mathematik und Physik
Published
1931-12
Volume
38-38
Issue
1
Pages
173-198
ISSN
  • 0026-9255 (ISSN-L)
  • 1436-5081
OpenAlex
W4256369010
Cited by
2,395
References
1
Citations by year
2026: 129 · 2025: 119 · 2024: 104 · 2023: 81 · 2022: 88 · 2021: 113 · 2020: 80 · 2019: 71 · 2018: 55 · 2017: 66 · 2016: 58 · 2015: 57 · 2014: 64 · 2013: 57 · 2012: 82
FWCI
5.75
Type
journal article
Language
de
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Monatshefte für Mathematik (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Mathematics › Geometry and Topology › Advanced Topology and Set Theory
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
Keywords
undecidability, Principia Mathematica, formal systems, incompleteness, Gödel's incompleteness theorems, self-reference

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

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.