UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC

DOI10.1017/S1755020316000459zbMath1417.03204arXiv1501.00155MaRDI QIDQ5737961

Fan Yang

Publication date: 31 May 2017

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

Full work available at URL: https://arxiv.org/abs/1501.00155

zbMATH Keywords

compositionalitydependence logicinquisitive logicteam semanticsuniform definability

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items (3)

Team semantics for interventionist counterfactuals: observations vs. interventions ⋮ Characterizing counterfactuals and dependencies over (generalized) causal teams ⋮ Modal logics that are both monotone and antitone: Makinson's extension results and affinities between logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional logics of dependence
• Structural completeness in propositional logics of dependence
• Inquisitive logic
• Algebraic translations, correctness and algebraic compiler construction
• Formal features of compositionality
• Epistemic operators in dependence logic
• Compositional semantics for a language of imperfect information
• LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE
• Remarks on Compositionality
• Axiomatizing Propositional Dependence Logics

This page was built for publication: UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC