- My eBooks
Ed Radio
Current song: Loading ...
Stream title:
Bit rate:
Current listeners:
Maximum listeners:
Server status:
AutoDJ status:
Source connected:
About
About Stephen Downes
About Stephen's Web
About OLDaily
Subscribe to Newsletters
gRSShopper
Threads Discussions
Privacy and Security Policy
Subscribe
Web - Today's OLDaily
Web - This Week's OLWeekly
Email - Subscribe
RSS - Individual Posts
RSS - Combined version
JSON - OLDaily
Viewer
Social Network
Stephen's Web and OLDaily
Half an Hour Blog
Google Plus Page
Twitter Feed
Flickr Photos
Huffington Post Blog
Slideshare
Blip TV
Professional
National Research Council Canada
Research Topics, Research Wiki, Code
Publications
Presentations
All My Articles
Contact
Email: stephen@downes.ca
Email: Stephen.Downes@nrc-cnrc.gc.ca
Skype: Downes
Not All...
My series on homeschooling will continue. But for now, this interruption.
Dave Taylor, who is normally rational, writes: "all cars should not be black." It's part of a presentation where he's trying to encourage people to "Allow experiment & change."
Fair enough. But does it have to be expressed in the form of a basic error of logic?
The sentence "all cars should not be black" means "No cars should be black." But this is not what he meant; this is as absolute as the behaviour he is trying to discourage.
What he wants to say here, of course, is "not all cars should be black." This allows that some cars can be black, and some cars can be other colours.
There really is no excuse for such a basic error in logic, and this particular error is far too common. Every time I read another case I wonder why basic illiteracy seems to be spreading through the educational community.
And this is not simply a matter of choice of expression, or of the changing nature of language. It is a matter of logic, not language, and logic, unlike language, does not vary with usage or over time.
For the uninitiated, the rules governing universals and negations are very simple:
All N are P = No N are not P
No N are P = All N are not P
Not All N are P = Some N are not P
Not No N are P = Some N are P
That's pretty simple, hm? These rules can easily be proven using two-circle Venn Diagrams.
Want more? Here is a more complete discussion of the equivalence of two-term categorical statements (from my Guide to the Logical Fallacies).
Now.. let's keep those categoricals straight, shall we?
Comments
Your Comment
You can preview your comment and continue editing until you are satisfied with it. Comment will not be posted on the Stephen's Web until you have clicked 'Done'.
Your comments always remain your property, but in posting them here
you agree to license under the same terms as this site
(CC By-NC-SA). If your comment is offensive it will
be deleted.
Automated Spam-checking is in effect. If you are a registered
user you may submit links and other HTML. Anonymous users cannot
post links and will have their content screened - certain words are prohibited
and your comment will be analyzed to make sure it makes sense.





