Path: dp-news.maxwell.syr.edu!spool.maxwell.syr.edu!drn.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!feed.news.tiscali.de!newsfeed01.sul.t-online.de!newsfeed00.sul.t-online.de!t-online.de!border2.nntp.dca.giganews.com!nntp.giganews.com!feed4.newsreader.com!newsreader.com!feed7.newsreader.com!newsreader.com!nntp.telenet.be!kwabbernoot.telenet-ops.be!phobos.telenet-ops.be.POSTED!not-for-mail
From: Jan Hidders <jan.hidders@REMOVETHIS.pandora.be>
User-Agent: Mozilla Thunderbird 0.8 (X11/20040923)
X-Accept-Language: en-us, en
MIME-Version: 1.0
Newsgroups: sci.logic,comp.databases.theory
Subject: Re: deductive databases
References: <xVQge.89347$4x.5404810@phobos.telenet-ops.be>   <UfidnT08ltmDeBrfRVn-ow@comcast.com>   <1414353.xgzfNHsJyF@yahoo.com>   <tf_he.92367$CQ5.5268587@phobos.telenet-ops.be>   <4384824.jt0uD6X4l9@yahoo.com>   <1116277053.955588.183340@g43g2000cwa.googlegroups.com>   <1301963.fDU1I1y9sr@yahoo.com>   <z6adnWDcxurG-xffRVn-pw@comcast.com>   <2833197.QA2ogCgjIP@yahoo.com>   <q9udnY3YMKQ1MBffRVn-gw@comcast.com>   <2040780.qLjtXq1iaR@yahoo.com>   <3fOdnZ1HYJi2hxbfRVn-tA@comcast.com>   <13164077.iA2d7LS8ze@yahoo.com>   <slrnd8n37i.uu.cmenzel@philebus.tamu.edu>   <1116444233.089781.282960@f14g2000cwb.googlegroups.com>   <slrnd8n61m.uu.cmenzel@philebus.tamu.edu>   <1116447451.925075.69070@g14g2000cwa.googlegroups.com>   <YZPie.94781$Xa1.5438591@phobos.telenet-ops.be> <1116466759.083158.315050@g49g2000cwa.googlegroups.com> <Rm6je.95714$iX1.5346435@phobos.telenet-ops.be> <vcby8aad4wm.fsf@beta19.sm.ltu.se> <ewpje.96579$Zr4.5632099@phobos.telenet-ops.be> <vcboeb5oiqj.fsf@beta19.sm.ltu.se>
In-Reply-To: <vcboeb5oiqj.fsf@beta19.sm.ltu.se>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 14
Message-ID: <0jqje.96619$Rk1.5615685@phobos.telenet-ops.be>
Date: Fri, 20 May 2005 18:49:32 GMT
NNTP-Posting-Host: 81.165.226.147
X-Complaints-To: abuse@telenet.be
X-Trace: phobos.telenet-ops.be 1116614972 81.165.226.147 (Fri, 20 May 2005 20:49:32 MEST)
NNTP-Posting-Date: Fri, 20 May 2005 20:49:32 MEST
Organization: Telenet Internet
Xref: dp-news.maxwell.syr.edu sci.logic:94249 comp.databases.theory:30936

Torkel Franzen wrote:
> Jan Hidders <jan.hidders@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?

In a structure with the two binary relations R and S. The formula should 
be true for precisely those structures in which S is the transitive 
closure of R.

-- Jan Hidders

