Re: Requirements for update languages?

From: Lauri Pietarinen <>
Date: Thu, 14 Nov 2002 14:18:13 +0200
Message-ID: <>

>Actually I think Paul was more asking the question whether everything can be
>done in pure FOL (or HOL, higher-order logics), and frankly I think the
>answer is yes. It is correct that doing aggregation is not trivial but also
>not mind-bogglingly difficult either, although it's a lot easier in HOL than
>In FOL.

So what is the conclusion? My understanding was that set theory is basis for all modern mathematics so how can something not be expressible with sets?

Lauri Pietarinen Received on Thu Nov 14 2002 - 13:18:13 CET

Original text of this message