file.pdf (184.3 kB)
0/0

Plausibly Hard Combinatorial Tautologies

Download (184.3 kB)
journal contribution
posted on 01.01.1997 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)

History

Publisher Statement

All Rights Reserved

Date

01/01/1997

Exports

Categories

Keyword(s)

Exports