Re: deductive databases
From: Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be>
Date: Sun, 22 May 2005 09:38:05 GMT
Message-ID: <1qYje.98019$Nu.5559387_at_phobos.telenet-ops.be>
Date: Sun, 22 May 2005 09:38:05 GMT
Message-ID: <1qYje.98019$Nu.5559387_at_phobos.telenet-ops.be>
Torkel Franzen wrote:
> Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be> writes:
>>
>>My reasoning was something like the following. A path will consist of a
>>sequence of pairs of numbers and can therefore be encoded in a single
>>number p such that there is a formula F(x,y,p) that is true iff the pair
>>(x,y) is in the path p.
>
> Now you're not talking about arbitrary structures.
Since we are doing PA they have to satisfy PA's axioms.
- Jan Hidders