The probability nesting game

Danièle Beauquier, Yoram Hirshfeld, Alexander Rabinovich, Anatol Slissenko

Research output: Contribution to journalConference articlepeer-review

Abstract

We investigate the first order predicate logic of probability and establish the game theoretic tools to prove that this language does not support unnesting of the probability operator. This is contrasted with the probabilistic prepositional logic where an unnesting algorithm exists.

Original languageEnglish
Pages (from-to)4-14
Number of pages11
JournalElectronic Notes in Theoretical Computer Science
Volume68
Issue number2
DOIs
StatePublished - Sep 2002
EventEXPRESS '02, 9th International Workshop on Expressiveness in Concurrency (Satellite Workshop of CONCUR 2002) - Brno, Czech Republic
Duration: 19 Aug 200219 Aug 2002

Fingerprint

Dive into the research topics of 'The probability nesting game'. Together they form a unique fingerprint.

Cite this