A note on propositional proof complexity of some Ramsey-type statements.

Published in: Arch. Math. Log. (2011)

Keyphrases

computational cost
first order logic
computational complexity
decision problems
database
data sets
natural language
lower bound
expert systems
propositional logic
space complexity
multiple types
polynomial hierarchy