Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information

DOI10.1007/s11225-013-9475-6zbMath1272.03123OpenAlexW1991986445MaRDI QIDQ1956374

Pietro Galliani, Allen L. Mann

Publication date: 13 June 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-013-9475-6

zbMATH Keywords

independence-friendly logicdependence logiccompositional semanticslogic with imperfect informationdependence-friendly logicequilibrium semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Probability and inductive logic (03B48)

Related Items (2)

Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications ⋮ Approximation and dependence via multiteam semantics

Cites Work

• Equilibrium semantics of languages of imperfect information
• Henkin quantifiers and complete problems
• Quantifiers vs. Quantification Theory
• Compositional semantics for a language of imperfect information
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information