Syllogistic logic with “Most”
Jörg Endrullis, Lawrence S. Moss · Mathematical Structures in Computer Science · 2019
Abstract We add MostXareYto the syllogistic logic of AllXareYand SomeXareY. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.