Rich, (01)
For any logic L, and any set of sentences S in L, the closure Cn(S)
is the set of all sentences that are entailed by S. (02)
There is a question about provability (turnstile operator) or
semantic entailment (double turnstile). For FOL, those two versions
coincide. Since Tarski developed his systems for versions of FOL,
you can assume either version. (03)
That Stanford article is not well written. I admire your tenacity
in digging through it, but the author chose to throw in too much
verbiage and symbols. This is a case where more is less. And
less would have been more. (04)
John (05)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (06)
|