Could Set Theory Actually Prove 1+1=3?

  • Thread starter Thread starter ilmareofthemai
  • Start date Start date
  • Tags Tags
    Set
AI Thread Summary
The discussion centers on the relationship between set theory and arithmetic operations, particularly the claim that 1+1 could equal 3 due to set theory's potential inconsistencies. Participants clarify that while set theory's consistency is uncertain, it cannot be definitively proven or disproven, referencing Gödel's incompleteness theorems. One contributor argues that the book's assertion of set theory's inconsistency is misleading, suggesting instead that we simply do not know its status. They also mention naive set theory, which is known to be inconsistent, but note that this issue has largely been addressed. The conversation highlights the complexities of mathematical foundations and the implications for arithmetic truths.
ilmareofthemai
Messages
16
Reaction score
1
Hello all!
I recently read A Universe in Zero Words (it actually has words), a book about the history and influence of important equations. It discussed (if I understood correctly) that our current arithmetic operations are based on set theory, and that since set theory isn't entirely consistent, that a proof of the sum of one and one being equal to three might be produced.
Thoughts?
R
 
Physics news on Phys.org
2+2

I would question what exactly is meant by saying that "set theory isn't entirely consistent".
 
ilmareofthemai said:
Hello all!
I recently read A Universe in Zero Words (it actually has words), a book about the history and influence of important equations. It discussed (if I understood correctly) that our current arithmetic operations are based on set theory, and that since set theory isn't entirely consistent, that a proof of the sum of one and one being equal to three might be produced.
Thoughts?
R

That book is not entirely correct then. Set theory might be completely consistent, but the problem is that we don't know. We can never actually prove that set theory is consistent or not. So while most mathematicians guess that set theory is consistent, we can never know for certain. This is one of Godel's incompleteness theorems.

So if the book says that set theory isn't entirely consistent, then that is false. The right thing to say is that we don't know whether it is consistent or not. And if it is consistent: then we will never be able to prove that it is consistent. But yes, it can be that set theory is inconsistent. So it might happen that we produce a proof of 1+1=3.
 
Well and then maybe they meant naive set theory, which is inconsistent due to the "set of all sets... " stuff. But that has kind of been resolved.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top