Independence-friendly logic without Henkin quantification

DOI10.1007/S00153-021-00781-8MaRDI QIDQ5918342zbMATH OpenOpenAlexFDO

Authors Fausto Barbero, Lauri Hella, Raine Rönnholm

Publication date 21 July 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

action recallexistential second-order logicindependence-friendly logicirregular formulasknowledge memorysignalling

Mathematics Subject Classification ID

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

Recommendations

• Independence-friendly logic without Henkin quantification
• Independence-friendly logic and axiomatic set theory
• scientific article; zbMATH DE number 5734948
• Independence in higher-order subclassical logic
• Hintikka's independence-friendly logic meets Nelson's realizability
• Quantifier-free logic for nondeterministic theories
• Dependence logic. A new approach to independence friendly logic
• Independence-friendly logic. A game-theoretic approach
• A complete axiomatisation for quantifier-free separation logic

Cites work

• Complexity of syntactical tree fragments of independence-friendly logic
• Compositional semantics for a language of imperfect information
• Decidability of IF modal logic of perfect recall
• Dependence logic. A new approach to independence friendly logic
• Dichotomy result for independence-friendly prefixes of generalized quantifiers
• Elements of finite model theory.
• Equivalence and quantifier rules for logic with imperfect information
• Finite Partially‐Ordered Quantifiers
• First-order spectra with one variable
• Henkin quantifiers: logic, games, and computation.
• Hierarchies of Partially Ordered Connectives and Quantifiers
• scientific article; zbMATH DE number 3889514 (Why is no real title available?)
• scientific article; zbMATH DE number 4143963 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1086489 (Why is no real title available?)
• scientific article; zbMATH DE number 1361517 (Why is no real title available?)
• scientific article; zbMATH DE number 4118333 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• Independence-friendly logic without Henkin quantification
• Independence-friendly logic. A game-theoretic approach
• Independent choices and the interpretation of IF logic
• ON EXISTENTIAL DECLARATIONS OF INDEPENDENCE IN IF LOGIC
• Signalling in IF games: a tricky business
• Some combinatorics of imperfect information

Cited in

(8)

• Hintikka's independence-friendly logic meets Nelson's realizability
• Expressivity of imperfect information logics without identity
• Complexity of syntactical tree fragments of independence-friendly logic
• Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
• On the expressive power of IF-logic with classical negation
• Dichotomy result for independence-friendly prefixes of generalized quantifiers
• Independence-friendly logic without Henkin quantification
• Independence-friendly logic and axiomatic set theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918342)