Introduction to Metamathematics¶
Kleene, S. C. (1952). Introduction to Metamathematics.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Fixed Point
- In computing, iterative algorithms compute least or greatest fixed points in dataflow analysis, type inference, and recursive definitions; loop termination is the existence of a stable state; and constructions that build fixed points of higher-order functions are what enable recursion in the first place.
This sourceDevelops recursion and least-fixed-point constructions (the recursion theorem) that make recursive definition and the fixed points of higher-order functions precise.
- In computing, iterative algorithms compute least or greatest fixed points in dataflow analysis, type inference, and recursive definitions; loop termination is the existence of a stable state; and constructions that build fixed points of higher-order functions are what enable recursion in the first place.
- Formal System
- In mathematics and logic it is Peano arithmetic, ZFC set theory, predicate calculus, and type theory — the foundational systems whose derivations are the medium of proof.
This sourceStandard reference defining formal systems (alphabet, formation rules, axioms, inference rules, derivation closure, effectiveness) and the syntax/interpretation distinction, including Peano arithmetic and the Church–Turing setting.
- In mathematics and logic it is Peano arithmetic, ZFC set theory, predicate calculus, and type theory — the foundational systems whose derivations are the medium of proof.
- Span
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:c220e07696dd · see in the full table