My own favorite is that effective first-order theories are in general semi-decidable (ie, recursively enumerable), which follows from the conjunction of Godel's completeness and incompleteness theorems.
|
1 | [made Community Wiki] | ||
|
|
||||
