Re: deductive databases
From: Torkel Franzen <torkel_at_sm.luth.se>
Date: 21 May 2005 13:01:17 +0200
Message-ID: <vcbd5rkonb6.fsf_at_beta19.sm.ltu.se>
Date: 21 May 2005 13:01:17 +0200
Message-ID: <vcbd5rkonb6.fsf_at_beta19.sm.ltu.se>
Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be> writes:
> By now I think you have enough information to know what the exact
> problem is. So for the sake of clarity: the structure consists of D, R,
> S, 0 and succ, and nothing else.
Well, it's still not the case that there is any set M of sentences in the corresponding first-order language such that for every countable structure I of the kind indicated, I satisfies the sentences in M if and only if R is the transitive closure of S. Received on Sat May 21 2005 - 13:01:17 CEST