Relational lattice completeness
From: Mikito Harakiri <mikharakiri_nospaum_at_yahoo.com>
Date: 30 Mar 2006 11:46:33 -0800
Message-ID: <1143747992.991792.44700_at_t31g2000cwb.googlegroups.com>
Mikito Harakiri wrote:
00
{(x=1,y=a)} = 11
{(x=1)}
{(y=a)}
01
`x` = 10
00
{(x=1)}
{(x=1), (x=2)}
{(x=1), (x=2), (x=3)}
{(x=1), (x=2), (x=3), (x=4)}
{(x=1), (x=2), (x=3), (x=4), (x=5)} = 11
01 Received on Thu Mar 30 2006 - 21:46:33 CEST
Date: 30 Mar 2006 11:46:33 -0800
Message-ID: <1143747992.991792.44700_at_t31g2000cwb.googlegroups.com>
Mikito Harakiri wrote:
> Jan Hidders wrote: > > I'm asking the question for a specific model, not in general as you > > did. For example, boolean algebra for boolean value *is* complete. > > According to Matt all that I have to do to prove incompleteness is to > find 2 nonisomorphic relational lattices with the same cardinality...
... and here they are:
#1
`xy` = 10 `x` `y`
00
{(x=1,y=a)} = 11
{(x=1)}
{(y=a)}
01
#2
`x` = 10
00
{(x=1)}
{(x=1), (x=2)}
{(x=1), (x=2), (x=3)}
{(x=1), (x=2), (x=3), (x=4)}
{(x=1), (x=2), (x=3), (x=4), (x=5)} = 11
01 Received on Thu Mar 30 2006 - 21:46:33 CEST