25822
The satisfiability problem becomes more difficult if both " for all " ( quantifier ) and " there exists " ( tautology ) co-NP-completes are allowed to bind the Boolean variables .
 person: Boolean
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: Boolean 
Answer:
 person: Boolean