On the computational consequences of independence in propositional logic

DOI10.1007/S11229-005-3878-5MaRDI QIDQ2500830zbMATH OpenOpenAlexFDO

Authors Merlijn Sevenster

Publication date 18 August 2006

Published in Synthese (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11229-005-3878-5

zbMATH Keywords

computational complexitydecision problemsgame theoryindependence-friendly propositional logicsquantifier independencesatisfiabilitysemantic gamevalidity

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 5180966
• Independent choices and the interpretation of IF logic
• A formal system for propositional extended IF logic
• Complexity of propositional logics in team semantic
• Conditional independence in propositional logic.

Cites work

• A course in game theory.
• Aspects of compositionality
• Finite partially-ordered quantification
• Formal features of compositionality
• Henkin quantifiers and complete problems
• scientific article; zbMATH DE number 1809623 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 2051379 (Why is no real title available?)
• scientific article; zbMATH DE number 1470716 (Why is no real title available?)
• scientific article; zbMATH DE number 972408 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• Lower bounds for multiplayer noncooperative games of incomplete information
• On branching quantifiers in English
• Partiality and games: Propositional logic
• The complexity of two-person zero-sum games in extensive form

Cited in

(13)

• Hybrid logic meets IF modal logic
• Properties of the logical consequence operation and its relationship with the independence of propositional logic
• Explicating logical independence
• On the conditional independence implication problem: a lattice-theoretic approach
• scientific article; zbMATH DE number 1670481 (Why is no real title available?)
• Independence in dynamically scheduled logic languages
• A formal system for propositional extended IF logic
• scientific article; zbMATH DE number 4072945 (Why is no real title available?)
• scientific article; zbMATH DE number 1946872 (Why is no real title available?)
• Equivalence criteria for compositional IF modal logics
• Computer Science Logic
• Logical Data Independence Reconsidered (Extended Abstract)
• Individual concepts as propositional variables in \(ML^{\nu +1}\)

This page was built for publication: On the computational consequences of independence in propositional logic

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