Changes

MyWikiBiz, Author Your Legacy — Friday May 03, 2024
Jump to navigationJump to search
Line 2,397: Line 2,397:  
===Conjunction Calculus===
 
===Conjunction Calculus===
   −
<pre>
+
{| align="center" cellpadding="8" width="90%" <!--QUOTE-->
| A 'conjunction calculus' is a deductive system dealing with truth and
  −
| conjunction.  Thus we assume that there is given a formula 'T' (= true)
  −
| and a binary operation '&' (= and) for forming the conjunction A & B of
  −
| two given formulas A and B.  Moreover, we specify the following additional
  −
| arrows and rules of inference:
   
|
 
|
|          O_A
+
<p>A ''conjunction calculus'' is a deductive system dealing with truth and conjunction. Thus we assume that there is given a formula <math>\operatorname{T}</math> (&nbsp;=&nbsp;true) and a binary operation <math>\land</math> (&nbsp;=&nbsp;and) for forming the conjunction <math>A \land B</math> of two given formulas <math>A\!</math> and <math>B.\!</math> Moreover, we specify the following additional arrows and rules of inference:</p>
| R2.   A -----> T,
+
|-
 
|
 
|
|              p1_A,B
+
<p><math>\begin{array}{ll}
| R3a.   A & B --------> A,
+
\text{R2.}  & A \xrightarrow{~\bigcirc_A~} \operatorname{T};
 +
\\[8pt]
 +
\text{R3a.} & A \land B \xrightarrow{~\pi_{A, B}~} A,
 +
\\[8pt]
 +
\text{R3b.} & A \land B \xrightarrow{~\pi'_{A, B}~} B,
 +
\\[8pt]
 +
\text{R3c.} & \dfrac{C \xrightarrow{~f~} A \quad C \xrightarrow{~g~} B}{C \xrightarrow{~\langle f, g \rangle~} A \land B}.
 +
\end{array}</math></p>
 +
|-
 
|
 
|
|              p2_A,B
+
<p>(Lambek & Scott, 47&ndash;48).</p>
| R3b.  A & B --------> B,
+
|}
|
  −
|          f          g
  −
|        C ---> A    C ---> B
  −
| R3c.  ----------------------.
  −
|          <f, g>
  −
|       C --------> A & B
  −
</pre>
      
===Positive Intuitionistic Propositional Calculus===
 
===Positive Intuitionistic Propositional Calculus===
12,080

edits

Navigation menu