DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS

DOI10.1017/jsl.2013.30zbMath1353.03016OpenAlexW2134900828MaRDI QIDQ5177884

Merlijn Sevenster

Publication date: 6 March 2015

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2013.30

zbMATH Keywords

independence-friendly logicdichotomydescriptive complexitybranching quantifiersHenkin quantifiersNP hardness

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80) Descriptive complexity and finite models (68Q19)

Related Items (7)

A Dichotomy Result for Ramsey Quantifiers ⋮ Cooperation in games and epistemic readings of independence-friendly sentences ⋮ Characterizing polynomial Ramsey quantifiers ⋮ Modeling Monty Hall in If Logic ⋮ Complexity of syntactical tree fragments of independence-friendly logic ⋮ Independence-friendly logic without Henkin quantification ⋮ SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION

Cites Work

• Unnamed Item
• Unnamed Item
• Henkin quantifiers and complete problems
• On the logic of informational independence and its applications
• Generalized quantifiers in dependence logic
• On the Structure of Polynomial Time Reducibility
• Compositional semantics for a language of imperfect information
• ON EXISTENTIAL DECLARATIONS OF INDEPENDENCE IN IF LOGIC
• Existential second-order logic over graphs
• Finite Partially‐Ordered Quantifiers

This page was built for publication: DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS