Skip to main content
Post Made Community Wiki
Source Link
Neel Krishnaswami
  • 9.2k
  • 1
  • 30
  • 54

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.