Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site peora.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!mtuxo!mtunh!mtung!mtunf!ariel!vax135!petsd!peora!jer
From: jer@peora.UUCP (J. Eric Roskos)
Newsgroups: net.singles
Subject: Re: Intelligence
Message-ID: <1242@peora.UUCP>
Date: Sun, 7-Jul-85 22:56:53 EDT
Article-I.D.: peora.1242
Posted: Sun Jul  7 22:56:53 1985
Date-Received: Tue, 9-Jul-85 05:46:00 EDT
References: <456@ttidcc.UUCP> <457@ttidcc.UUCP> <1586@hao.UUCP>
Organization: Perkin-Elmer SDC, Orlando, Fl.
Lines: 31

>>they don't know how to do proofs using quantifiers.
>
>Forgive my ignorance, but would this ability have  any  practical  use  for
>anyone  other than a mathematician or advanced researcher?  Apparently not,
>if your students can get along without it.

EVERYONE should know how to do proofs with quantifiers!  For one thing, it's
taught in the introductory CS math courses most places, and for another,
it'll probably be on that test you're going to take, if it's any good...
I mean, everyone should know that

	"For all x, y"

is the same as

	"It is not the case that there exists an x such that not(y)".

Among other things, not knowing basic principles of logic like that makes
it hard to argue coherently in everyday discourse.

You should also know all the other basic theorems of logic, like De Morgan's
Theorems, etc... even if you don't know them as such, you probably use them
in writing programs...
-- 
Shyy-Anzr:  J. Eric Roskos
UUCP:       ..!{decvax,ucbvax,ihnp4}!vax135!petsd!peora!jer
US Mail:    MS 795; Perkin-Elmer SDC;
	    2486 Sand Lake Road, Orlando, FL 32809-7642

	    "Gurl zhfg hcjneq fgvyy, naq bajneq,
	     Jub jbhyq xrrc noernfg bs gehgu."  -- WEY