Skip to main content Accessibility help

Syllogistic logic with “Most”

  • Jörg Endrullis (a1) (a2) and Lawrence S. Moss (a2)


We add Most X are Y to the syllogistic logic of All X are Y and Some X are Y. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.


Corresponding author

*Corresponding author. Email:


Hide All
Lai, T., Endrullis, J. and Moss, L. S. (2016). Majority digraphs. Proceedings of the American Mathematical Society 144(9): 37013715.
Moss, L. S. (2008). Completeness theorems for syllogistic fragments. In: Hamm, F. and Kepser, S. (eds.) Logics for Linguistic Structures, Mouton de Gruyter, Berlin, 143173.
Pratt-Hartmann, I. (2009). No syllogisms for the numerical syllogistic. In: Languages: from Formal to Natural, vol. 5533, LNCS, Springer, Berlin 192203.
Pratt-Hartmann, I. and Moss, L. S. (2009). Logics for the relational syllogistic. Review of Symbolic Logic 2(4):647683.



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed