definition 3.81 Effective axiomatization

open in the book · parts/02-mathematical-methods/01-logic-sets.tex:2308 · p. 45

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

definition 3.81: Effective axiomatization3.81definition 3.80: Formal system3.80proposition A.15: Syntax is computableA.15theorem 3.87: Gödel, 19313.87definition A.16: RepresentabilityA.16definition 3.82: Consistency, completeness, soundness3.82definition 3.83: Peano arithmetic3.83lemma 3.86: Diagonal lemma3.86theorem 3.98: Church–Turing3.98theorem 3.84: Gödel's completeness theorem, 19303.84definition 3.93: Computable function, decidable set3.93equation A.120: eq:app-inc-codingA.120theorem A.26: Diagonal lemmaA.26proof : app:A-long-proofs@proof-12proofequation 3.86: eq:provability-predicate3.86theorem A.29: Second incompleteness theoremA.29theorem 3.88: Gödel's second incompleteness theorem3.88proof : ch:01-logic-sets@proof-20proof

Edges

typedirectionnode provenancewhere
depends_on Formal system declared parts/02-mathematical-methods/01-logic-sets.tex:2311
depends_on Syntax is computable declared appendices/A-long-proofs.tex:1967
depends_on Gödel, 1931 declared parts/02-mathematical-methods/01-logic-sets.tex:2471