theorem A.26 Diagonal lemma

open in the book · appendices/A-long-proofs.tex:2349 · p. 2803

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

theorem A.26: Diagonal lemmaA.26proposition A.15: Syntax is computableA.15theorem A.17: RepresentabilityA.17theorem A.27: RosserA.27proof : app:A-long-proofs@proof-20proofdefinition 3.93: Computable function, decidable set3.93definition 3.81: Effective axiomatization3.81equation A.120: eq:app-inc-codingA.120proof : app:A-long-proofs@proof-12proofdefinition A.16: RepresentabilityA.16lemma A.20: \Sigma_1-completenessA.20theorem A.25: thm:app-inc-primrecA.25proposition A.28: prop:app-inc-derivabilityA.28theorem A.30: Church, TuringA.30proof : app:A-long-proofs@proof-19prooflemma A.19: Numerals behaveA.19proof : app:A-long-proofs@proof-21proof

Edges

typedirectionnode provenancewhere
depends_on Syntax is computable declared appendices/A-long-proofs.tex:2356
depends_on Representability declared appendices/A-long-proofs.tex:2356
depends_on Rosser declared appendices/A-long-proofs.tex:2428
proves app:A-long-proofs@proof-20 declared appendices/A-long-proofs.tex:2359