Independence-friendly logic without Henkin quantification

DOI10.1007/s00153-021-00781-8zbMath1496.03112OpenAlexW3171585767MaRDI QIDQ5918342

Raine Rönnholm, Lauri Hella, Fausto Barbero

Publication date: 21 July 2021

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00781-8

zbMATH Keywords

independence-friendly logicexistential second-order logicsignallingaction recallirregular formulasknowledge memory

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Signaling and communication in game theory (91A28) Logic with extra quantifiers and operators (03C80) Descriptive complexity and finite models (68Q19)

Cites Work

• Elements of finite model theory.
• First-order spectra with one variable
• Independent choices and the interpretation of IF logic
• Complexity of syntactical tree fragments of independence-friendly logic
• Some combinatorics of imperfect information
• Equivalence and quantifier rules for logic with imperfect information
• Hierarchies of Partially Ordered Connectives and Quantifiers
• Compositional semantics for a language of imperfect information
• ON EXISTENTIAL DECLARATIONS OF INDEPENDENCE IN IF LOGIC
• DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS
• Finite Partially‐Ordered Quantifiers
• Independence-friendly logic without Henkin quantification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independence-friendly logic without Henkin quantification