Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.201
Several formal systems proving the valid forms of Aristotelian syllogism has been built. However, the previous research has not answered the two questions: (1) how to infer the primary forms of syllogism by which the other valid forms of syllogism can be deducted; and (2) whether formal system of Aristotelian syllogism can be run automatically; if yes, by which language and grammar it can be done. The paper solves the two questions. For the question (1), the paper sets up a rule system to product all the valid forms of syllogism including that primary ones for deducting the other valid forms of syllogism. For the question (2), the paper proposes the sufficient conditions for a formal system being an automata, to which the formal system FA created by the paper is conformable. So the paper asserts FA can prove all the valid forms of Aristotelian syllogism automatically in computers nowadays.
Formal system; Aristotelian syllogism; automata; automatic reasoning
Zhang Yinsheng, Qiao Xiaodong, "A Formal System of Aristotelian Syllogism Based on Automata Grammar", Computer Science and Information Engineering, World Congress on, vol. 05, no. , pp. 173-178, 2009, doi:10.1109/CSIE.2009.201