Two notes on propositional primal logic

  • Yuri Gurevich

MSR-TR-2011-70 |

Propositional primal logic, as defined by Gurevich and Neeman,
has two kinds of quotations: p said f, and p implied f.

Note 1. The derivation problem for propositional primal logic with one
kind of quotations is solvable linear time.

Note 2. In the Hilbertian calculus for propositional primal logic, the
shortest derivation of a formula f from hypotheses H may be
exponential in the length of (H,f).