12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Thursday November 07, 2024
Jump to navigationJump to searchDirectory talk:Jon Awbrey/Papers/Differential Propositional Calculus (view source)
Revision as of 02:58, 25 June 2008
, 02:58, 25 June 2008→Current Version @ PlanetMath : TeX Format: update
\section{Transitional remarks}
\section{Transitional remarks}
$\ldots$
\textbf{Temporary Note.} The remainder of this discussion uses the syntax for propositional calculus that is described in the entry on minimal negation operators. Logical negation is written by enclosing an expression in parentheses, for example, $(x)$ is $\lnot x.$ Logical conjunction is written by concatenating expressions in the manner of algebraic products, for example, $x\ y\ z$ is $x \land y \land z.$ For the time being, further details can be found in the entry just mentioned.
\section{Formal development}
\section{Formal development}
\operatorname{or} &
\operatorname{or} &
e_i = 0 &
e_i = 0 &
\operatorname{for~all}\ i = 1\ \operatorname{to}\ n. \\
\operatorname{for}\ i = 1\ \operatorname{to}\ n. \\
\end{matrix}$\end{quote}
\end{matrix}$\end{quote}
\operatorname{or} &
\operatorname{or} &
e_i = 1 &
e_i = 1 &
\operatorname{for~all}\ i = 1\ \operatorname{to}\ n. \\
\operatorname{for}\ i = 1\ \operatorname{to}\ n. \\
\end{matrix}$\end{quote}
\end{matrix}$\end{quote}
\operatorname{or} &
\operatorname{or} &
e_i = (a_i) &
e_i = (a_i) &
\operatorname{for~all}\ i = 1\ \operatorname{to}\ n. \\
\operatorname{for}\ i = 1\ \operatorname{to}\ n. \\
\end{matrix}$\end{quote}
\end{matrix}$\end{quote}
