What is a list of "reasonable but undecidable" theorems?
Godel's First Incompleteness Theorem: &quot;Any consistent formal system within which a certain amount of elementary arithmetic can be carried out is incomplete.&quot;
&quot;A certain amount of elementary arithmetic&quot; can be considered as reasonable properties of... well all math.
Incompleteness can also be seen as a form of undecidability.