Syllogistics reduces to only two rules of inference: monotonicity and symmetry, plus a third if one wants to take existential import into account. We give an implementation that uses only the monotonicity and symmetry rules, with an addendum for the treatment of existential import. Soundness follows from the monotonicity properties and symmetry properties of the Aristotelean quantiﬁers, while completeness for syllogistic theory is proved by direct inspection of the valid syllogisms. Next, the valid syllogisms are decomposed in terms of the rules they involve. The implementation uses Haskell , and is given in ‘literate programming’ style .
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A Note on the Monotonicity of Reducible Quantifiers.R. Zuber - 2010 - Journal of Logic, Language and Information 19 (1):123-128.
Weak Vs. Strong Readings of Donkey Sentences and Monotonicity Inference in a Dynamic Setting.Makoto Kanazawa - 1994 - Linguistics and Philosophy 17 (2):109 - 158.
Monotonicity and Collective Quantification.Ben-Avi Gilad & Winter Yoad - 2003 - Journal of Logic, Language and Information 12 (2):127-151.
Constrained Monotonicity and the Measurement of Power.Manfred J. Holler, Rie Ono & Frank Steffen - 2001 - Theory and Decision 50 (4):383-395.
Added to index2009-01-28
Total downloads30 ( #167,361 of 2,153,485 )
Recent downloads (6 months)2 ( #280,610 of 2,153,485 )
How can I increase my downloads?