Re: computational model of transactions

paul c wrote:
> Marshall wrote:
> > Brian Selzer wrote:
> >> The point
> >> I was trying to make was based on the idea that there can only be two types
> >> of propositions in a database: (1) propositions that are invariably true,
> >> that is, whose truth is guaranteed not to change regardless of any
> >> circumstance that may arise in the world of the database; and (2)
> >> propositions whose truth depended on the state of the world of the database
> >> that was current at the point of the last update.
> >
> > I'm not sure I follow this. Can you give some examples?
> >
> >
> > Marshall
> >
>
> 1) all sets have subsets?

Okay, sure, that's a proposition that is invariably true, but given that, why would you put that in the database?

> 2) king of france is bald?

Oh, king, eh? Very nice. And how'd he get that, then? By exploiting the workers! By hanging on to outdated imperialist dogma which perpetuates the economic and social differences in our society. If there's ever going to be any progress...

Marshall Received on Sat Aug 05 2006 - 20:14:50 CEST