一种图解公理系统与两种符号公理系统中有效直言三段论的证明
Proofs of valid categorical syllogisms in one diagrammatic and two symbolic axiomatic systems
AI总结:
本研究从莱布尼茨的逻辑草稿中提炼出莱布尼茨-凯莱(LC)代数系统,结合麦科尔-拉德(ML)关系系统分别证明经典直言三段论,并通过二者与布尔代数的关联,论证莱布尼茨在相关布尔代数片段应用上早于布尔的历史优先性。
摘要:
戈特弗里德·莱布尼茨(Gottfried Leibniz)曾启动一项研究计划,旨在通过图解法和代数法证明所有亚里士多德式直言三段论。他成功用欧拉图(Euler diagrams)完成了证明,但并未留下包含代数证明的手稿。我们证实,散见于莱布尼茨各类逻辑学草稿中的关键片段已包含足够要素,可通过一种代数方法完成证明——我们将其命名为莱布尼茨-凯莱(Leibniz-Cayley, LC)系统——无需借助表达力更强、更复杂的一阶量化逻辑机制。此外,我们还采用休·麦科尔(Hugh McColl)和克里斯汀·拉德(Christine Ladd)研究的直言关系,通过一种关系方法——我们称之为麦科尔-拉德(McColl-Ladd, ML)系统——再次证明了经典直言三段论。最后,我们揭示了ML和LC与布尔代数(Boolean algebra)的关联,证明ML是LC的推论,而LC是布尔格公理的推论,由此确立了莱布尼茨在刻画并应用(布尔代数的一个充分片段)以有效解决直言三段论问题方面,相较于乔治·布尔(George Boole)的历史优先性。
英文摘要:
Gottfried Leibniz embarked on a research program to prove all the Aristotelic categorical syllogisms by diagrammatic and algebraic methods. He succeeded in proving them by means of Euler diagrams, but didn't produce a manuscript with their algebraic proofs. We demonstrate how key excerpts scattered across various Leibniz's drafts on logic contained sufficient ingredients to prove them by an algebraic method -- which we call the Leibniz-Cayley (LC) system -- without having to make use of the more expressive and complex machinery of first-order quantificational logic. In addition, we prove the classic categorical syllogisms again by a relational method -- which we call the McColl-Ladd (ML) system -- employing categorical relations studied by Hugh McColl and Christine Ladd. Finally, we show the connection of ML and LC with Boolean algebra, proving that ML is a consequence of LC, and that LC is a consequence of the Boolean lattice axioms, thus establishing Leibniz's historical priority over George Boole in characterizing and applying (a sufficient fragment of) Boolean algebra to effectively tackle categorical syllogistic.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。