Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!rutgers!ames!ucbcad!ucbvax!KESTREL.ARPA!ladkin
From: ladkin@KESTREL.ARPA.UUCP
Newsgroups: mod.ai
Subject: language comparisons
Message-ID: <8702112035.AA13798@kestrel.ARPA>
Date: Wed, 11-Feb-87 15:35:50 EST
Article-I.D.: kestrel.8702112035.AA13798
Posted: Wed Feb 11 15:35:50 1987
Date-Received: Fri, 13-Feb-87 02:05:53 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 20
Approved: ailist@sri-stripe.arpa

Walter Hamscher writes:

> Here's one way to characterize richness: A is richer than B if symbol
> structures in A can finitely denote facts (i.e., the interpreter can
> interpret as) that B can't. 

I suppose the intention of `richer than' is to be an 
aymmetric comparative. Thus, he needs to add some condition 
such as:

 A can also finitely denote all facts that B can't

to rule out cases where both A is richer than B and 
B is richer than A. A case of this would be first-order logic
and modal logic. Each may express conditions that are 
inexpressible in the other (e.g. irreflexivity for modal logic,
well-cappedness for first-order logic).

peter ladkin
ladkin@kestrel.arpa