Gödel's Theorem

From HomoExcelsior

Jump to: navigation, search

Any proposed axiom set for arithmetic is either consistent (no contradictions can be derived) or complete (it will say yes or no to every arithmetic proposition). In other words, any axiom set strong enough to include arithmetic which is complete will be inconsistent (it will say yes and no to at least one question).




User groups