The best of all possible Leibnizian completeness theorems

Australasian Journal of Logic (forthcoming)
  Copy   BIBTEX

Abstract

Leibniz developed several arithmetical interpretations of the assertoric syllogistic in a series of drafts from April 1679. In this article, I present what I take to be one of his most mature articulations of the arithmetical semantics from that series. I show that the assertoric syllogistic can be characterized exactly not only in the full divisibility lattice, as Leibniz implicitly suggests, but in a certain four-element sublattice thereof. This refinement is also shown to be optimal in the sense that the assertoric syllogistic is not complete with respect to any smaller sublattice using Leibniz’s truth conditions.

Author's Profile

Yale Weiss
CUNY Graduate Center

Analytics

Added to PP
2025-01-26

Downloads
128 (#96,456)

6 months
128 (#37,878)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?