Plausibly Hard Combinatorial Tautologies

1997-01-01T00:00:00Z (GMT) by Jeremy Avigad
We present a simple propositional proof system which consists of a single axiom schema and a single rule, and use this system to construct a sequence of combinatorial tautologies that, when added to any Frege system, p-simulates extended-Frege systems.

Categories

Keyword(s)

License

In Copyright