Re: deductive databases

From: Torkel Franzen <torkel_at_sm.luth.se>
Date: 20 May 2005 20:27:48 +0200
Message-ID: <vcboeb5oiqj.fsf_at_beta19.sm.ltu.se>


Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be> writes:

> "There exists a formula over two binary predicates R and S that is true
> iff S is the transitive closure of R."

  True in what structure? Received on Fri May 20 2005 - 20:27:48 CEST

Original text of this message