Carnegie Mellon University
Browse

Plausibly Hard Combinatorial Tautologies

Download (184.3 kB)
journal contribution
posted on 1997-01-01, 00:00 authored by Jeremy AvigadJeremy 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.

History

Publisher Statement

All Rights Reserved

Date

1997-01-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC