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 .
 person: Gödel
Given options, please tell me the categories of all the listed entity words.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
 Entities: Gödel 
Answer:
 person: Gödel