2173
For a first order predicate calculus , Gödel 's completeness theorem states that the theorems ( provable statements ) are exactly the logically valid well-formed formulas , so identifying valid formulas is recursively enumerable : given unbounded resources , any valid formula can eventually be proven .
 Gödel
Please list all entity words in the text that fit the category. Output format is "word1, word2". 
Option: location, person, organization 
Text: {0} 
Answer:
 Gödel