首页> 外文会议>International conference on future computer, control and communication;FCCC 2010 >Operations on Propositions and Relations between Propositions in Probabilistic Propositional Logic
【24h】

Operations on Propositions and Relations between Propositions in Probabilistic Propositional Logic

机译:概率命题逻辑中的命题运算和命题之间的关系

获取原文

摘要

A probabilistic logic system is the logic description of a probabilistic space,a proposition describes a event,and the relations between propositions are the relations between the events described by the propositions. There are two layers of propositional equivalence,the equality of propositional truth values and the equality of propositional meanings. The connectives are essentially the operations on propositions,two valued logic system is homomorphic with the Boolean algebra <{0,1},-t,V,A>,so all connectives may be defined as the truth value functions on {0,1}. A probabilistic logic system is a Boolean algebra homomorphic with the event domain in a probabilistic space,so all connectives may be defined exactly by the set functions on an event domain instead of the truth value functions on {0,1/. The classical formal system of propositional calculus is also applicable to probabilistic propositions.
机译:概率逻辑系统是概率空间的逻辑描述,命题描述事件,命题之间的关系是命题描述的事件之间的关系。命题对等有两层,命题真值的相等和命题含义的相等。连接词本质上是对命题的运算,二值逻辑系统与布尔代数<{0,1},-t,V,A>是同态的,因此所有连接词都可以定义为{0,1上的真值函数}。概率逻辑系统是在事件空间中具有事件域的布尔代数,因此所有连接词都可以由事件域上的集合函数准确定义,而不是由{0,1 /上的真值函数定义。命题演算的经典形式系统也适用于概率命题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号