Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies

DOI10.1016/j.jcss.2014.04.004zbMath1327.03019OpenAlexW2033995545MaRDI QIDQ2453581

Daniel Gorín, Santiago Figueira, Rafael Grimson

Publication date: 10 June 2014

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

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.004

zbMATH Keywords

independence-friendly logicsecond-order logicexpressive powerflattening operatorimperfect information logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the formal semantics of IF-like logics
• IF-logic and truth-definition
• Independent choices and the interpretation of IF logic
• On the Expressive Power of IF-Logic with Classical Negation
• On the semantics of informational independence
• Hierarchies of number-theoretic predicates
• Equivalence and quantifier rules for logic with imperfect information
• On generalized quantifiers in arithmetic
• Compositional semantics for a language of imperfect information
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification
• Henkin quantifiers and the definability of truth

This page was built for publication: Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies