Peirce's Law • 5
•
https://inquiryintoinquiry.com/2023/10/23/peirces-law-5/
Equational Form —
A stronger form of Peirce's law also holds, in which the
final implication is observed to be reversible, resulting
in the following equivalence.
• ((p ⇒ q) ⇒ p) ⇔ p
The converse implication p ⇒ ((p ⇒ q) ⇒ p) is clear enough on
general principles, since p ⇒ (r ⇒ p) holds for any proposition r.
Representing propositions as logical graphs under the existential
interpretation, the strong form of Peirce's law is expressed by
the following equation.
Peirce's Law : Strong Form
•
https://inquiryintoinquiry.files.wordpress.com/2023/10/peirces-law-strong-f…
Reference —
Peirce, Charles Sanders (1885), “On the Algebra of Logic :
A Contribution to the Philosophy of Notation”, American
Journal of Mathematics 7 (1885), 180–202. Reprinted
(CP 3.359–403), (CE 5, 162–190).
Resources —
Logical Graphs
•
https://oeis.org/wiki/Logical_Graphs
Peirce's Law
•
https://oeis.org/wiki/Peirce%27s_law
Logical Graphs • First Impressions
•
https://inquiryintoinquiry.com/2023/08/24/logical-graphs-first-impressions/
Logical Graphs • Formal Development
•
https://inquiryintoinquiry.com/2023/09/01/logical-graphs-formal-development…
Propositional Equation Reasoning Systems
•
https://oeis.org/wiki/Propositional_Equation_Reasoning_Systems
Regards,
Jon
cc:
https://www.academia.edu/community/LmZXml