Abstract
We propose new axiomatizations of the 24 assertoric syllogisms of Aristotle’s syllogistic, and the \(2^{2^n}\) n-ary operations of Boole’s algebraic logic. The former organizes the syllogisms as a \(6\times 4\) table partitioned into four connected components according to which term if any must be inhabited. We give two natural-deduction style axiomatizations, one with four axioms and four rules, the second with one axiom and six rules. The table provides immediately visualizable proofs of soundness and completeness. We give an elementary category-theoretic semantics for the axioms along with criteria for determining the term if any required to be nonempty in each syllogism. We base the latter on Lawvere’s notion of an algebraic theory as a category with finite products having as models product-preserving set-valued functors. The benefit of this axiomatization is that it avoids the dilemma of whether a Boolean algebra is a numerical ring as envisaged by Boole, a logical lattice as envisaged by Peirce, Jevons, and Schroeder, an intuitionistic Heyting algebra on a middle-excluding diet as envisaged by Heyting, or any of several other candidates for the “true nature” of Boolean logic. Unlike general rings, Boolean rings have only finitely many n-ary operations, permitting a uniform locally finite axiomatization of their theory in terms of a certain associative multiplication of finite 0–1 matrices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We take the traditional proscription in logic of the empty universe to be a pointless superstition that creates more problems than it solves.
- 2.
This makes more sense when phrased more precisely as a property of each member of the empty class; with no members no opportunity for an inconsistency ever arises.
- 3.
When succinctness is important symbols can be shortened by a factor of four by writing them in hexadecimal, exploited in the C program mentioned at the end of Sect. 16.2.2.
- 4.
The C program mentioned at the end of Sect. 16.2.2 represents S, P, and M as respectively 10101010, 11001100, and 11110000.
References
Boole, G. (1847). The mathematical analysis of logic, being an essay towards a calculus of deductive reasoning. London: Macmillan.
Brouwer, L. E. J. (1920). Intuitionische mengenlehre. Jahresber. Dtsch. Math. Ver, 28, 203–208.
Corcoran, J. (1974). Aristotle’s natural deduction system. In J. Corcoran (Ed.), Ancient logic and its modern interpretations, synthese historical library (pp. 85–131). Berlin: Springer.
Halmos, P. R. (1963). Lectures on Boolean algebras. Van Nostrand.
Heyting, A. (1930). Die formalen Regeln der intuitionischen Logik. In Sitzungsberichte Die Preussischen Akademie der Wissenschaften (pp. 42–56). Physikalische-Mathematische Klasse.
Lawvere, W. (1963). Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences, 50(5), 869–873.
Lukasiewicz, J. (1957). Aristotle’s Syllogistic (2nd ed.). Oxford: Clarendon Press.
Parikh, R. (1978). A completeness result for a propositional dynamic logic. In Lecture notes in computer science (Vol. 64, pp. 403–415). Berlin: Springer.
Parsons, T. (1997). The traditional square of opposition. In Stanford encyclopedia of philosophy. Stanford University.
Pratt, V. R. (1975). Every prime has a succinct certificate. SIAM Journal of Computing, 4(3), 214–220.
Pratt, V. R. (1976). Semantical considerations on Floyd–Hoare logic. In Proceedings of the 17th annual IEEE symposium on foundations of computer science (pp. 109–121).
Pratt, V. R. (2006). Boolean algebras canonically defined. Wikipedia.
Stone, M. (1936). The theory of representations for Boolean algebras. Transactions of the American Mathematical Society, 40, 37–111.
Zhegalkin, I. I. (1927). On the technique of calculating propositions in symbolic logic. Matematicheskii Sbornik, 43, 9–28.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Pratt, V. (2017). Aristotle, Boole, and Categories. In: Başkent, C., Moss, L., Ramanujam, R. (eds) Rohit Parikh on Logic, Language and Society. Outstanding Contributions to Logic, vol 11. Springer, Cham. https://doi.org/10.1007/978-3-319-47843-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-47843-2_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47842-5
Online ISBN: 978-3-319-47843-2
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)