Definition:Gentzen Proof System/Instance 1

Definition
 This instance of a Gentzen proof system is used in:



Let $\mathcal L$ be the language of propositional logic.

The Gentzen system applies to sets of propositional formulae.

The intuition behind the system is that a set $U$ represents its disjunction.

$\mathscr G$ has the following axioms and rules of inference:

Axioms
A set $U$ of propositional formulae is an axiom of $\mathscr G$ iff $U$ contains a complementary pair of literals.

The invocation of an axiom may be denoted by:


 * $\vdash U$

Rules of Inference
Let $U_1, U_2$ be sets of propositional formulae.

$\mathscr G$ has two rules of inference, labeled $(\alpha)$ and $(\beta)$:

$(\alpha)$: For any $\alpha$-formula $\mathbf A$ and associated $\mathbf A_1, \mathbf A_2$:


 * Given $U_1 \cup \left\{{\mathbf A_1}\right\}$ and $U_2 \cup \left\{{\mathbf A_2}\right\}$, one may infer $U_1 \cup U_2 \cup \left\{{\mathbf A}\right\}$.

$(\beta)$: For any $\beta$-formula $\mathbf B$ and associated $\mathbf B_1, \mathbf B_2$:


 * Given $U_1 \cup \left\{{\mathbf B_1, \mathbf B_2}\right\}$, one may infer $U_1 \cup \left\{{\mathbf B}\right\}$.

Invocations of these rules in a proof can be denoted as:


 * $(\alpha) \dfrac{\vdash U_1, \mathbf A_1 \hspace{3em} \vdash U_2, \mathbf A_2}{\vdash U_1, U_2, \mathbf A} \hspace{3em}

(\beta) \dfrac{\vdash U_1, \mathbf B_1, \mathbf B_2}{\vdash U_1, \mathbf B_1}$

This notation suppresses the set notation as a matter of convenience.