%0 Journal Article
%T Set Algebra is Semantic Interpretation for Classical Formal System of Propositional Calculus<br>集合代数是经典命题演算形式系统的语义解释
%A LIU Hong-lan
%A GAO Qing-shi
%A YANG Bing-ru
%A <br>刘宏岚
%A 高庆狮
%A 杨炳儒
%J 计算机科学
%D 2010
%I 
%X The well formed formulas(wffs) in classical formal system of propositional calculus(CPC) arc only some formal symbols,whose meanings are given by a interpretation. Both logic algebra and set algebra are Boolean algebra,and are interpretations for CPC. A set algebra is a set semantics for CPC, in which set operations are the interpretation for connectives, set functions arc the interpretation for wffs, the set inclusion is the interpretation for logical implication,and the set equality= is the interpretation for logical equivalence. Standard probabilistic logic is based on a standard probabilistic space, a proposition describes a random event which is a set, the event domain in a probabilistic space is a set algebra, probabilistic logic is j ust the practical application of the set semantics for CPC. We can perform event calculus instead of probability calculus in CPC. CPC is applicable to probabilistic propositional calculus completely.
%K CPC
%K Probabilistic propositional logic
%K Probabilistic space
%K Set algebra
%K Homomorphism<br>经典命题演算形式系统
%K 概率命题逻辑
%K 概率空间
%K 集合代数
%K 同态
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=DA6D1EF107DAD2D8E20D109FFDE55F1B&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=9CF7A0430CBB2DFD&sid=5D9D6A8FC2C66FD8&eid=2BA123C6EB9D54C2&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10