Equivalence and quantifier rules for logic with imperfect information
From MaRDI portal
Publication:3613174
DOI10.1093/jigpal/jzn030zbMath1160.03007MaRDI 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 logic; independence-friendly logic; information flow in games; prenex form theorem; Skolem forms of classical formulas
03B60: Other nonclassical logic
Related Items
Remarks on Compositionality, SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION, Independence-friendly logic without Henkin quantification, Complexity of two-variable dependence logic and IF-logic, Equilibrium semantics of languages of imperfect information, On the formal semantics of IF-like logics, 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 syntactical tree fragments of independence-friendly logic, Team semantics for interventionist counterfactuals: observations vs. interventions, Classical negation and game-theoretical semantics, Henkin quantifiers and Boolean formulae: a certification perspective of DQBF, Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies, Thompson transformations for IF-logic