Re: [KIF] Re: SUO: tuples
> In fact, the only way I can think of
> to get some such approach with sequences to work is to allow only unary
> predicates in one's language and to force domains to consist of nothing
> but sequences of objects.
What would be the limitations or problems with this approach?
I ask that because there may be a connection between this approach and that
of the IFF-MT, where
1. we identify sequences with tuples, and
2. we identify the unary predicates above with the classification relation
between tuples (relation instances) and relation types
(R s) iff s |= R
3. relations have a fixed arity (where the arity is a sequence of entity
types; i.e. we have sorts)
4. domains that consist of sequences of objects are Cartesian products of
component domains (actually, the IFF-MT relaxes this a bit).
Robert E. Kent