Re: Relational lattice completeness
From: Mikito Harakiri <mikharakiri_nospaum_at_yahoo.com>
Date: 7 Apr 2006 08:56:21 -0700
Message-ID: <1144425381.861024.325960_at_e56g2000cwe.googlegroups.com>
Date: 7 Apr 2006 08:56:21 -0700
Message-ID: <1144425381.861024.325960_at_e56g2000cwe.googlegroups.com>
vc wrote:
> Speaking of the OP question, is he trying to show that his query
> language is as expressive/'complete' as RA/RC, more
> expressive/'complete', or his question is about something completely
> different ?
It's not clear who you assume the Delphi is. Jan asked about the completeness first. After the round of exchanges I once again think that speaking about completeness of axiom system is premature until we establish the axiom system in the first place
http://www.phil.cam.ac.uk/research_fellows/leng/b_theories3_02.pdf
As for Jan's equality expression derivation rule, does the Spight criteria (which is an implication in meta language) fit there? Received on Fri Apr 07 2006 - 17:56:21 CEST