Computability and Logic¶
Boolos, G. S., Burgess, & Jeffrey, R. C. (2007). Computability and Logic. Cambridge University Press.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Well-Foundedness (Well-Ordering)
- … landscape; gradient-descent optimisation terminates only if the loss landscape has well-founded structure) — all deploy the no-infinite-descent structural pattern to guarantee termination, enable induction, or block paradoxical regress, a unifying point of view also emphasized in Boolos, Burgess, & Jeffrey (2007).
This sourceStandard text on computability, recursion, and the philosophical landscape of formal systems; treats well-foundedness and induction in unified fashion.
- … landscape; gradient-descent optimisation terminates only if the loss landscape has well-founded structure) — all deploy the no-infinite-descent structural pattern to guarantee termination, enable induction, or block paradoxical regress, a unifying point of view also emphasized in Boolos, Burgess, & Jeffrey (2007).
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. The single citation of this work carries no recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
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:dcec60fb14eb · see in the full table