proposition A5.1 Syntax is computable

open in the book · appendices/05-incompleteness.tex:58 · p. 2902

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

proposition A5.1: Syntax is computableA5.1definition 7.93: Computable function, decidable set7.93definition 7.81: Effective axiomatization7.81equation A5.3: eq:app-inc-codingA5.3theorem A5.12: Diagonal lemmaA5.12proof : app:incompleteness@proof-1proofdefinition 7.92: Turing machine7.92theorem A5.3: RepresentabilityA5.3theorem 7.98: Church–Turing7.98theorem 7.96: Turing7.96theorem 7.97: Rice7.97theorem 7.95: Universal machine7.95definition 7.80: Formal system7.80theorem 7.87: Gödel, 19317.87theorem A5.13: RosserA5.13proof : app:incompleteness@proof-9proof

Edges

typedirectionnode provenancewhere
depends_on Computable function, decidable set declared appendices/05-incompleteness.tex:66
depends_on Effective axiomatization declared appendices/05-incompleteness.tex:66
depends_on eq:app-inc-coding declared appendices/05-incompleteness.tex:66
depends_on Diagonal lemma declared appendices/05-incompleteness.tex:455
proves app:incompleteness@proof-1 declared appendices/05-incompleteness.tex:69