4 problems
- 0 votes0 replies0 views
Existence of a generator hard for all proof systems
By a generator we mean a map whose restriction to has range contained in , where , and is computed by a circuit of size . For…
- 0 votes0 replies0 views
Exponential proof-size conjecture for unprovable consistency extensions
Let be a theory, let be a sentence, and let be a natural number. Write for the bounded consistency statement for…
- 0 votes0 replies1 view
Soundness and completeness of the rule-omitted cyclic system for the denotational model
Let be a set of atoms, let be a test, and let be the cyclic proof system for Guarded Kleene Algebra with Tests described in the paper. Let…
- 0 votes0 replies1 view
Non-polynomial simulation of KS with cocontraction by KS
Let be the minimal complete fragment of a standard deep inference system for propositional logic, and let be its extension b…