Independence-friendly logic without Henkin quantification

DOI10.1007/978-3-662-55386-2_2zbMath1496.03111OpenAlexW2724849512MaRDI QIDQ5915779

Raine Rönnholm, Fausto Barbero, Lauri Hella

Publication date: 20 December 2017

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://trepo.tuni.fi/handle/10024/116929

zbMATH Keywords

independence-friendly logicexpressive powerexistential second-order logicsignallinggame-theoretical semanticsaction recallHenkin quantification

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)

Related Items (3)

Cooperation in games and epistemic readings of independence-friendly sentences ⋮ Complexity of syntactical tree fragments of independence-friendly logic ⋮ Independence-friendly logic without Henkin quantification

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