INQUISITIVE BISIMULATION
DOI10.1017/JSL.2020.77OpenAlexW4206039406MaRDI QIDQ5000255FDOQ5000255
Authors: Ivano A. Ciardelli, Martin Otto
Publication date: 12 July 2021
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03483
Recommendations
- Bisimulation in inquisitive modal logic
- Bisimulation and logic
- scientific article; zbMATH DE number 7585719
- Symbolic bisimulations
- Bisimulation and divergence
- scientific article
- Bisimulation invariance and finite models
- On quasi-open bisimulation
- Vietoris bisimulations
- Bisimulation as a logical relation
team semanticsfinite model theorybisimulationexpressive completenessvan Benthem theoreminquisitive modal logicmodel theory of modal logics
Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45) Logic with extra quantifiers and operators (03C80) Logic in computer science (03B70) Basic properties of first-order languages and structures (03C07) Applications of model theory (03C98)
Cites Work
- Dependence logic. A new approach to independence friendly logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Compositional semantics for a language of imperfect information
- Handbook of modal logic
- Propositional logics of dependence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dependency as Question Entailment
- Inquisitive logic
- From IF to BI. A tale of dependence and separation
- Inquisitive Semantics
- Neighborhood semantics for modal logic
- Neighbourhood Structures: Bisimilarity and Basic Model Theory
- Modal characterisation theorems over special classes of frames
- Towards a Logic of Information Exchange
- Inquisitive dynamic epistemic logic
- On the semantics and logic of declaratives and interrogatives
- A Van Benthem Theorem for Modal Team Semantics
- Modal logic over finite structures
- Modal and guarded characterisation theorems over finite transition systems
- Questions as information types
- Title not available (Why is that?)
- Highly acyclic groups, hypergraph covers, and the guarded fragment
Cited In (4)
This page was built for publication: INQUISITIVE BISIMULATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000255)