Line 2,418: |
Line 2,418: |
| ===Positive Intuitionistic Propositional Calculus=== | | ===Positive Intuitionistic Propositional Calculus=== |
| | | |
− | <pre>
| + | {| align="center" cellpadding="8" width="90%" <!--QUOTE--> |
− | | A 'positive intuitionistic propositional calculus' is a conjunction calculus | |
− | | with an additional binary operation '<=' (= if). Thus, if A and B are formulas,
| |
− | | so are T, A & B, and A <= B. (Yes, most people write B => A instead.) We also
| |
− | | specify the following new arrow and rule of inference:
| |
| | | | | |
− | | !e!_A,B
| + | <p>A ''positive intuitionistic propositional calculus'' is a conjunction calculus with an additional binary operation <math>\Leftarrow</math> ( = if). Thus, if <math>A\!</math> and <math>B\!</math> are formulas, so are <math>\operatorname{T},</math> <math>A \land B,</math> and <math>A \Leftarrow B.</math> (Yes, most people write <math>B \Rightarrow A</math> instead.) We also specify the following new arrow and rule of inference.</p> |
− | | R4a. (A <= B) & B ---------> A,
| + | |- |
| | | | | |
− | | h
| + | <p><math>\begin{array}{ll} |
− | | C & B ---> A
| + | \text{R4a.} & (A \Leftarrow B) \land B \xrightarrow{~\varepsilon_{A, B}~} A, |
− | | R4b. ----------------.
| + | \\[8pt] |
− | | h*
| + | \text{R4b.} & \dfrac{C \land B \xrightarrow{~h~} A}{C \xrightarrow{~h^*~} A \Leftarrow B}. |
− | | C ----> A <= B | + | \end{array}</math></p> |
| + | |- |
| | | | | |
− | </pre> | + | <p>(Lambek & Scott, 48–49).</p> |
| + | |} |
| | | |
| ===Intuitionistic Propositional Calculus=== | | ===Intuitionistic Propositional Calculus=== |