Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site cornell.UUCP Path: utzoo!linus!decvax!tektronix!uw-beaver!cornell!nax From: nax@cornell.UUCP Newsgroups: net.singles Subject: What's you number, Mr. Godel? Message-ID: <2954@cornell.UUCP> Date: Mon, 8-Jul-85 09:53:23 EDT Article-I.D.: cornell.2954 Posted: Mon Jul 8 09:53:23 1985 Date-Received: Tue, 16-Jul-85 04:24:49 EDT Sender: nax@cornell.UUCP Organization: Cornell Univ. CS Dept. Lines: 24 From: nax (Nax-Paul) J. Eric Roskos writes: > 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)". If we're turning net.single into net.logic, let's not bias it immediately to non-constructive logic ;-) I'm reminded of a prof who suggested that at a cocktail party we could impress that certain MOTAS by proving the 5-color theorem on a napkin, then invite him/her back to your place to do the 4-color theorem. Is *that* why this discussion is in net.singles ???? See you at the Moosewood! nax@cornell