Product logic and probabilistic Ulam games
详细信息    查看全文
文摘
There is a well-known game semantics for Lukasiewicz logic, introduced by Daniele Mundici, namely the Rényi–Ulam game. Records in a Rény–Ulam game are coded by functions, which constitute an MV-algebra, and it is possible to prove a completeness theorem with respect to this semantics. In this paper we investigate some probabilistic variants of the Rényi–Ulam game, and we prove that some of them constitute a complete game semantics for product logic, whilst some other constitute a game semantics for a logic between ΠMTL and product logic.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700