The following pages link to (Q3396588):
Displaying 14 items.
- Equilibrium semantics of languages of imperfect information (Q636301) (← links)
- Propositional games with explicit strategies (Q731893) (← links)
- A remark on collective quantification (Q1006495) (← links)
- Modelling simultaneous games in dynamic logic (Q1024134) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Computation as social agency: what, how and who (Q1641025) (← links)
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information (Q1956374) (← links)
- Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227) (← links)
- A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
- Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
- Modeling Monty Hall in If Logic (Q3299843) (← links)
- The Computational Complexity of Quantified Reciprocals (Q3623832) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
- Independence-friendly logic without Henkin quantification (Q5918342) (← links)
