What is a list of "reasonable but undecidable" theorems? There are some theorems that go along the lines of &quot;all reasonable properties of &lt;math subject&gt; are computationally undecidable.&quot; Here are two examples:

Rice's Theorem: &quot;all reasonable semantic properties of programs are undecidable.&quot;
Adian–Rabin Theorem: &quot;all reasonable properties of finitely presented groups are undecidable.&quot;

Even though I only know of two examples, I suspect that there are many theorems like these. Is there a list of these kinds of 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.