theorem A.17 Representability

open in the book · appendices/A-long-proofs.tex:2006 · p. 2799

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

theorem A.17: RepresentabilityA.17definition A.16: RepresentabilityA.16definition 3.93: Computable function, decidable set3.93lemma A.20: \Sigma_1-completenessA.20theorem A.25: thm:app-inc-primrecA.25proposition A.28: prop:app-inc-derivabilityA.28theorem A.30: Church, TuringA.30theorem A.26: Diagonal lemmaA.26theorem A.27: RosserA.27proof : app:A-long-proofs@proof-19proofdefinition 3.80: Formal system3.80definition 3.92: Turing machine3.92proposition A.15: Syntax is computableA.15theorem 3.98: Church–Turing3.98theorem 3.96: Turing3.96theorem 3.97: Rice3.97theorem 3.95: Universal machine3.95definition A.18: \Delta_0 and \Sigma_1A.18lemma A.19: Numerals behaveA.19proposition 3.22: Algebra of propositions3.22proof : app:A-long-proofs@proof-14prooflemma A.23: Sequence lemmaA.23lemma A.24: lem:app-inc-beta-delta0A.24proof : app:A-long-proofs@proof-18proofequation A.129: eq:app-inc-provA.129theorem A.29: Second incompleteness theoremA.29proof : app:A-long-proofs@proof-22prooftheorem 3.84: Gödel's completeness theorem, 19303.84proof : app:A-long-proofs@proof-24proofproof : app:A-long-proofs@proof-20proofproof : app:A-long-proofs@proof-21proof

Edges

typedirectionnode provenancewhere
depends_on Representability declared appendices/A-long-proofs.tex:2012
depends_on Computable function, decidable set declared appendices/A-long-proofs.tex:2012
depends_on $\Sigma_{1}$-completeness declared appendices/A-long-proofs.tex:2012
depends_on thm:app-inc-primrec declared appendices/A-long-proofs.tex:2012
depends_on prop:app-inc-derivability declared appendices/A-long-proofs.tex:2489
depends_on Church, Turing declared appendices/A-long-proofs.tex:2581
depends_on Diagonal lemma declared appendices/A-long-proofs.tex:2356
depends_on Rosser declared appendices/A-long-proofs.tex:2428
proves app:A-long-proofs@proof-19 declared appendices/A-long-proofs.tex:2288