If a theorem required an uncountable amount of information or symbols to prove it, would this mean it could be true but unprovable. Are we just limited because we can only write a countable number of symbols? Could the theorem be proved in some other sense?(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Provability of a theorem?

**Physics Forums | Science Articles, Homework Help, Discussion**