proposition A.15 Syntax is computable

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

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

proposition A.15: Syntax is computableA.15definition 3.93: Computable function, decidable set3.93definition 3.81: Effective axiomatization3.81equation A.120: eq:app-inc-codingA.120theorem A.26: Diagonal lemmaA.26proof : app:A-long-proofs@proof-12proofdefinition 3.92: Turing machine3.92theorem A.17: RepresentabilityA.17theorem 3.98: Church–Turing3.98theorem 3.96: Turing3.96theorem 3.97: Rice3.97theorem 3.95: Universal machine3.95definition 3.80: Formal system3.80theorem 3.87: Gödel, 19313.87theorem A.27: RosserA.27proof : app:A-long-proofs@proof-20proof

Edges

typedirectionnode provenancewhere
depends_on Computable function, decidable set declared appendices/A-long-proofs.tex:1967
depends_on Effective axiomatization declared appendices/A-long-proofs.tex:1967
depends_on eq:app-inc-coding declared appendices/A-long-proofs.tex:1967
depends_on Diagonal lemma declared appendices/A-long-proofs.tex:2356
proves app:A-long-proofs@proof-12 declared appendices/A-long-proofs.tex:1970