Erik M. Jensen (Case Western Reserve University - School of Law) has posted Law School Attire: A Call for a Uniform Uniform Code (Oklahoma City University Law Review, Forthcoming). Here is the abstract:
Law professors dress scruffily, and we need to do something about that.
If you think law professors are scruffy, try analytic philosophers. Luckily, there is a solution for everyone--to wit, the following from Philosophers' Playground:
The nature of fashion is predicated upon the satisfaction of the "goes with" relation, G. An outfit meets the conditions of fashion acceptability only if it is comprised of a bottom covering, b, and a top covering, t, such that it is true that Gtb.
While the satisfaction of the "goes with" relation for top and bottom coverings is a necessary condition for an outfit to be categorized as "sharp," it is not sufficient for sharpness as the if-clause requires accessorization.
Initially, it was thought that accessories would require the "goes with" relation to be expanded from a binary to an arbitrary n-ary relation, but it was shown possible to group accessorization constants into a single variable which have been determined to satisfy the relation themselves. That is, one can show that shoes and a belt go together independent of the outfit and that if a given bottom covering, say a particular pair of pants P, and given top covering, say a given shirt S, have been demonstrated to go together, that is for which GPS has already been demonstrated, then for a pair of shoes, h, to be fashion acceptable they must satisfy the "goes with" relation G(PS)h. Such iterations must be repeated until a complete outfit has been assembled.
The reason why analytic philosophers (and similarly mathematicians and cognitive scientists) have a difficult time dressing themselves or dress poorly is that the satisfaction of any sentence involving the "goes with" relation is not finitely decidable. There is no algorithm by which one can in a finite amount of time, much less in the morning before you are too late for class, decide with deductive certainty whether an outfit is sharp and properly accessorized. Now, there are rules which by which we can rule out entire classes of ordered pairs, e.g., let x be a member of the class of checked clothing and y be a member of the class of striped clothing, it is fairly trivial to show that for all such x and all such y, Gxy must be false (I leave it as an exercise to the reader to provide a proof). But for the general case there is no finitely executable decision procedure such that for any two arbitrary articles of clothing one may determine the satisfaction of G.
There were, of course, hopes in the 40s and 50s for such a breakthrough. But the dream of a "Cou-turing machine" faded with the suicide of Alan Turing. "Not only did he have the greatest mind in history for devising formal solutions to problems like this, but as a snazzy dressing gay man himself, he was the only one who could bring all the elements together -- the Carson Kressley of the post-war computation theory set. Bloody MI-5, with their homophobic poppycock," a former colleague was reported to have said, "They doomed all of us geeks to a series of lonely Saturday nights."
While that explains the lack of fashion sense on the analytic side of the aisle, the continental fashion phenomenon is also easily saved because we are dealing only with an infinitely more simple limiting case. For continental philosophers, the "goes with" relationship is trivially true because it can be shown as a direct result of a basic lemma (the Klein theorem -- that's Calvin, not Felix) that for all pieces of apparel x and y which are proper subsets of the class B of black clothing, the sentence Gxy must be true.
Amen.
