Re: computational model of transactions

From: paul c <toledobythesea_at_oohay.ac>
Date: Sat, 05 Aug 2006 17:43:14 GMT
Message-ID: <SM4Bg.318554$iF6.161336@pd7tw2no>

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?
2. king of france is bald?

(BTW, in neither case does the truth depend on database currency.)

p Received on Sat Aug 05 2006 - 12:43:14 CDT