Leibniz's 333-year-old problem solved
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Arithmetizations of the traditional syllogistic. The first Leibniz trial to arithmetize the Aristotelian syllogistic explored divisibility of integers; it was unsuccessful. The second one used pairs of co-prime numbers and was successful, as Slupecki proved. However, this second translation did not include the syllogistics of term negation or term conjunction. In this paper Sotirov justifies the viability of Leibniz' earlier and less complicated idea and proposes two translations into arithmetic that are appropriate for the extended syllogistic as well.|
|Math Topics:||Logic/Foundations, Number Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.