The probability nesting game

DOI10.1016/S1571-0661(05)80360-3zbMath1270.03050OpenAlexW2064764969MaRDI QIDQ2842598

Danièle Beauquier, Alexander Rabinovich, Anatol Slissenko, Joram Hirschfeld

Publication date: 15 August 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(05)80360-3

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• An analysis of first-order logics of probability
• Decidability and expressiveness for first-order logics of probability
• A logic for reasoning about probabilities
• An application of games to the completeness problem for formalized theories
• The complexity of probabilistic verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The probability nesting game