Re: deductive databases
From: Torkel Franzen <torkel_at_sm.luth.se>
Date: 22 May 2005 07:47:48 +0200
Message-ID: <vcbacmnolq3.fsf_at_beta19.sm.ltu.se>
Date: 22 May 2005 07:47:48 +0200
Message-ID: <vcbacmnolq3.fsf_at_beta19.sm.ltu.se>
Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be> writes:
> You meant *finite* M, right?
No, finite or infinite, by compactness.
> 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. Received on Sun May 22 2005 - 07:47:48 CEST