| Line 1: |
Line 1: |
| − | ==Content from PlanetMath== | + | ==Notes & Queries== |
| | + | |
| | + | ==Place for Discussion== |
| | + | |
| | + | ==LaTeX Version== |
| | | | |
| | <pre> | | <pre> |
| − | \textbf{Peirce's law} is a proposition in propositional calculus that is commonly expressed in the following form: | + | \PMlinkescapeword{algebra} |
| | + | \PMlinkescapeword{Algebra} |
| | + | \PMlinkescapeword{application} |
| | + | \PMlinkescapeword{Application} |
| | + | \PMlinkescapeword{calculus} |
| | + | \PMlinkescapeword{Calculus} |
| | + | \PMlinkescapeword{chooses} |
| | + | \PMlinkescapeword{Chooses} |
| | + | \PMlinkescapeword{connected} |
| | + | \PMlinkescapeword{Connected} |
| | + | \PMlinkescapeword{ma} |
| | + | \PMlinkescapeword{MA} |
| | + | \PMlinkescapeword{place} |
| | + | \PMlinkescapeword{Place} |
| | + | \PMlinkescapeword{point} |
| | + | \PMlinkescapeword{Point} |
| | + | \PMlinkescapeword{project} |
| | + | \PMlinkescapeword{Project} |
| | + | \PMlinkescapeword{qed} |
| | + | \PMlinkescapeword{QED} |
| | + | \PMlinkescapeword{side} |
| | + | \PMlinkescapeword{Side} |
| | + | \PMlinkescapeword{states} |
| | + | \PMlinkescapeword{States} |
| | + | \PMlinkescapeword{strong} |
| | + | \PMlinkescapeword{Strong} |
| | + | \PMlinkescapeword{stronger} |
| | + | \PMlinkescapeword{Stronger} |
| | + | \PMlinkescapeword{volume} |
| | + | \PMlinkescapeword{Volume} |
| | + | |
| | + | \textbf{Peirce's law} is a formula in propositional calculus that is commonly expressed in the following form: |
| | | | |
| | \[ ((p \Rightarrow q) \Rightarrow p) \Rightarrow p \] | | \[ ((p \Rightarrow q) \Rightarrow p) \Rightarrow p \] |
| | | | |
| | Peirce's law holds in classical propositional calculus, but not in intuitionistic propositional calculus. The precise axiom system that one chooses for classical propositional calculus determines whether Peirce's law is taken as an axiom or proven as a theorem. | | Peirce's law holds in classical propositional calculus, but not in intuitionistic propositional calculus. The precise axiom system that one chooses for classical propositional calculus determines whether Peirce's law is taken as an axiom or proven as a theorem. |
| | + | |
| | + | \tableofcontents |
| | | | |
| | \section{History} | | \section{History} |
| Line 15: |
Line 52: |
| | A \textit{fifth icon} is required for the principle of excluded middle and other propositions connected with it. One of the simplest formulae of this kind is: | | A \textit{fifth icon} is required for the principle of excluded middle and other propositions connected with it. One of the simplest formulae of this kind is: |
| | | | |
| − | \[ \{ (x \prec y) \prec x \} \prec x. \] | + | \[ \{ (x \,-\!\!\!< y) \,-\!\!\!< x \} \,-\!\!\!< x. \] |
| | | | |
| − | This is hardly axiomatical. That it is true appears as follows. It can only be false by the final consequent $x$ being false while its antecedent $(x \prec y) \prec x$ is true. If this is true, either its consequent, $x$, is true, when the whole formula would be true, or its antecedent $x \prec y$ is false. But in the last case the antecedent of $x \prec y$, that is $x$, must be true. (Peirce, CP 3.384). | + | This is hardly axiomatical. That it is true appears as follows. It can only be false by the final consequent $x$ being false while its antecedent $(x \,-\!\!\!< y) \,-\!\!\!< x$ is true. If this is true, either its consequent, $x$, is true, when the whole formula would be true, or its antecedent $x \,-\!\!\!< y$ is false. But in the last case the antecedent of $x \,-\!\!\!< y$, that is $x$, must be true. (Peirce, CP 3.384). |
| | \end{quote} | | \end{quote} |
| | | | |
| Line 25: |
Line 62: |
| | From the formula just given, we at once get: | | From the formula just given, we at once get: |
| | | | |
| − | \[ \{ (x \prec y) \prec a \} \prec x, \] | + | \[ \{ (x \,-\!\!\!< y) \,-\!\!\!< a \} \,-\!\!\!< x, \] |
| | | | |
| − | where the $a$ is used in such a sense that $(x \prec y) \prec a$ means that from $(x \prec y)$ every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of $x$ follows the truth of $x$. (Peirce, CP 3.384). | + | where the $a$ is used in such a sense that $(x \,-\!\!\!< y) \,-\!\!\!< a$ means that from $(x \,-\!\!\!< y)$ every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of $x$ follows the truth of $x$. (Peirce, CP 3.384). |
| | \end{quote} | | \end{quote} |
| | | | |
| − | \textbf{Note.} The above transcription uses the ``precedes sign" ($\prec$) for the ``sign of illation'' that Peirce customarily wrote as a cursive symbol somewhat like a gamma ($\gamma$) turned on its side or else typed as a bigram consisting of a dash and a ``less than" sign. | + | \textbf{Note.} Peirce uses the ``sign of illation'' ($-\!\!\!<$) for implication. In one place he explains it as a variant of the sign ($\le$) for ``less than or equal to''; in another place he suggests reading $A \,-\!\!\!< B$ as ``$A$, in every way that it can be, is $B$''. |
| | + | |
| | + | \section{Graphical proof} |
| | + | |
| | + | Representing \PMlinkname{propositions}{PropositionalCalculus} as \PMlinkname{logical graphs}{LogicalGraph} under the \PMlinkname{existential interpretation}{LogicalGraphFormalDevelopment}, Peirce's law is expressed by means of the following formal equation: |
| | + | |
| | + | \begin{center}\begin{tabular}{cc} |
| | + | \includegraphics[scale=0.8]{PeircesLawFigure1} & (1) \\ |
| | + | \end{tabular}\end{center} |
| | + | |
| | + | \textbf{Proof.} Using the axiom set given in the entry for \PMlinkname{logical graphs}{LogicalGraph}, Peirce's law may be proved in the following manner. |
| | + | |
| | + | \begin{center}\begin{tabular}{cc} |
| | + | \includegraphics[scale=0.8]{PeircesLawFigure2} & (2) \\ |
| | + | \end{tabular}\end{center} |
| | + | |
| | + | \section{Equational form} |
| | + | |
| | + | A stronger form of Peirce's law also holds, in which the final implication is observed to be reversible: |
| | + | |
| | + | \[ ((p \Rightarrow q) \Rightarrow p) \Leftrightarrow p \] |
| | + | |
| | + | \subsection{Proof 1} |
| | + | |
| | + | Given what precedes, it remains to show that: |
| | + | |
| | + | \[ p \Rightarrow ((p \Rightarrow q) \Rightarrow p) \] |
| | + | |
| | + | But this is immediate, since $p \Rightarrow (r \Rightarrow p)$ for any proposition $r.$ |
| | | | |
| − | \section{Graphic proof} | + | \subsection{Proof 2} |
| | | | |
| − | Under the existential interpretation of Peirce's logical graphs, Peirce's law is represented by means of the following formal equivalence or logical equation.
| + | Representing \PMlinkname{propositions}{PropositionalCalculus} as \PMlinkname{logical graphs}{LogicalGraph} under the \PMlinkname{existential interpretation}{LogicalGraphFormalDevelopment}, the strong form of Peirce's law is expressed by the following equation: |
| | | | |
| − | \begin{verbatim} | + | \begin{center}\begin{tabular}{cc} |
| − | o-----------------------------------------------------------o
| + | \includegraphics[scale=0.8]{PeircesLawFigure3} & (3) \\ |
| − | | Peirce's Law. . . . . . . . . . . . . . . . . . . . . . . |
| + | \end{tabular}\end{center} |
| − | o-----------------------------------------------------------o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . p o---o q . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . = . . . . . . . . . @ . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o-----------------------------------------------------------o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . .(((p (q)) (p)) (p))) . = . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o-----------------------------------------------------------o
| |
| − | \end{verbatim} | |
| | | | |
| − | \textbf{Proof.} Using the axiom set given in the entry for logical graphs, Peirce's law may be proved in the following manner.
| + | Using the axioms and theorems listed in the entries on \PMlinkname{logical graphs}{LogicalGraph}, the equational form of Peirce's law may be proved in the following manner: |
| | | | |
| − | \begin{verbatim} | + | \begin{center}\begin{tabular}{cc} |
| − | o-----------------------------------------------------------o
| + | \includegraphics[scale=0.8]{PeircesLawFigure4} & (4) \\ |
| − | | Peirce's Law. . Proof . . . . . . . . . . . . . . . . . . |
| + | \end{tabular}\end{center} |
| − | o-----------------------------------------------------------o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . p o---o q . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o==================================< Collect >==============o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o q . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . p o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o==================================< Recess >===============o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . p o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o==================================< Refold >===============o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . p o---o p . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o==================================< Delete >===============o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . o---o . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . | . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o==================================< Refold >===============o
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . @ . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | | . . . . . . . . . . . . . . . . . . . . . . . . . . . . . |
| |
| − | o==================================< QED >==================o
| |
| − | \end{verbatim} | |
| | | | |
| | \section{Bibliography} | | \section{Bibliography} |