Rule of Conjunction/Proof Rule/Tableau Form
Proof Rule
Let $\phi$ and $\psi$ be two well-formed formulas in a tableau proof.
The Rule of Conjunction is invoked for $\phi$ and $\psi$ in the following manner:
| Pool: | The pooled assumptions of each of $\phi$ and $\psi$ | ||||||||
| Formula: | $\phi \land \psi$ | ||||||||
| Description: | Rule of Conjunction | ||||||||
| Depends on: | Both of the lines containing $\phi$ and $\psi$ | ||||||||
| Abbreviation: | $\operatorname {Conj}$ or $\land \II$ |
Also denoted as
Sources which refer to this rule as the rule of adjunction may as a consequence give the abbreviation $\operatorname {Adj}$.
Sources
- 1965: E.J. Lemmon: Beginning Logic ... (previous) ... (next): Chapter $1$: The Propositional Calculus $1$: $3$ Conjunction and Disjunction