On the formal semantics of IF-like logics

DOI10.1016/j.jcss.2009.10.006zbMath1197.03028OpenAlexW2171275058MaRDI QIDQ980942

Daniel Gorín, Rafael Grimson, Santiago Figueira

Publication date: 8 July 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/12820

zbMATH Keywords

signalingindependence-friendly logicvaluationfull abstractioncompositional semanticsflattening operatorregular formulas

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies ⋮ Defining behaviorizeable relations to enable inference in semi-automatic program synthesis ⋮ Classical negation and game-theoretical semantics

Cites Work

• On the logic of informational independence and its applications
• On branching quantifiers in English
• Independent choices and the interpretation of IF logic
• On the semantics of informational independence
• Equivalence and quantifier rules for logic with imperfect information
• Second-Order Logic and Foundations of Mathematics
• 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