Equivalence and quantifier rules for logic with imperfect information
From MaRDI portal
Publication:3613174
DOI10.1093/jigpal/jzn030zbMath1160.03007OpenAlexW2168555998MaRDI QIDQ3613174
Francien Dechesne, Xavier Caicedo, Theo M. V. Janssen
Publication date: 11 March 2009
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzn030
IF logicindependence-friendly logicinformation flow in gamesprenex form theoremSkolem forms of classical formulas
Related Items (15)
Equilibrium semantics of languages of imperfect information ⋮ Henkin quantifiers and Boolean formulae: a certification perspective of DQBF ⋮ Epistemic operators in dependence logic ⋮ Expressivity of imperfect information logics without identity ⋮ Compositional natural language semantics using independence friendly logic or dependence logic ⋮ Complexity of two-variable dependence logic and IF-logic ⋮ Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies ⋮ Complexity of syntactical tree fragments of independence-friendly logic ⋮ Classical negation and game-theoretical semantics ⋮ On the formal semantics of IF-like logics ⋮ Thompson transformations for IF-logic ⋮ Independence-friendly logic without Henkin quantification ⋮ Team semantics for interventionist counterfactuals: observations vs. interventions ⋮ Remarks on Compositionality ⋮ SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
This page was built for publication: Equivalence and quantifier rules for logic with imperfect information
