Computer Science – Logic in Computer Science
Scientific paper
2011-10-11
Computer Science
Logic in Computer Science
Scientific paper
We extend the language of the classical syllogisms with the sentence-forms
"At most 1 p is a q" and "More than 1 p is a q". We show that the resulting
logic does not admit a finite set of syllogism-like rules whose associated
derivation relation is sound and complete, even when reductio ad absurdum is
allowed.
No associations
LandOfFree
The Syllogistic with Unity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Syllogistic with Unity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Syllogistic with Unity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-471760