Godel's Theorem


(Godel's incompleteness theorem) 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). See What is Godel's theorem?.



Refer to this page:


Related Terms:


Note: If a company/institute/site doesn't want to present its own information in nanodic.com, it can sent one e-mail to info@nanodic.com.