On the public citation graph
Modal independence logic:
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-27660-6_19openalex-snapshot
Complexity of Model Checking for Modal Dependence Logic
inferredcites →https://doi.org/10.1007/978-3-642-33167-1_6openalex-snapshot
Deciding Epistemic and Strategic Properties of Cryptographic Protocols
inferredcites →https://doi.org/10.1007/978-3-642-39992-3_13openalex-snapshot
Extended Modal Dependence Logic $\mathcal{EMDL}$
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-3-662-48057-1_21openalex-snapshot
Complexity of Propositional Independence and Inclusion Logic
inferredcites →https://doi.org/10.1007/bf00206326openalex-snapshot
The dining cryptographers problem: Unconditional sender and recipient untraceability
inferredcites →https://doi.org/10.1007/s10849-015-9217-4openalex-snapshot
A Double Team Semantics for Generalized Quantifiers
inferredcites →https://doi.org/10.1007/s11225-013-9479-2openalex-snapshot
Dependence and Independence
inferredcites →https://doi.org/10.1016/j.apal.2011.08.005openalex-snapshot
Inclusion and exclusion dependencies in team semantics — On some logics of imperfect information
inferredcites →https://doi.org/10.1093/logcom/exn102openalex-snapshot
Model-theoretic and Computational Properties of Modal Dependence Logic
inferredcites →https://doi.org/10.1145/2000378.2000408openalex-snapshot
Abstraction for epistemic model checking of dining cryptographers-based protocols
inferredcites →https://doi.org/10.1215/00294527-2010-036openalex-snapshot
A Remark on Negation in Dependence Logic
inferredcites →https://doi.org/10.2307/2274406openalex-snapshot
Johan van Benthem. Modal logic and classical logic. Indices, no. 3. Bibliopolis, Naples 1985 (©1983), also distributed by Humanities Press, Atlantic Highlands, N.J., 234 pp.
inferredcites →https://doi.org/10.4230/lipics.csl.2015.277openalex-snapshot
A Van Benthem Theorem for Modal Team Semantics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-39951-1_10openalex-snapshot
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-47709-0_11openalex-snapshot
Characterizing Frame Definability in Team Semantics via the Universal Modality
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_22openalex-snapshot
Modal Inclusion Logic: Being Lax is Simpler than Being Strict
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_24openalex-snapshot
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality
inferred← citeshttps://doi.org/10.1007/s00153-024-00957-yopenalex-snapshot
Axiomatizing modal inclusion logic and its variants
inferred← citeshttps://doi.org/10.1007/s10472-021-09730-wopenalex-snapshot
Parameterised complexity of model checking and satisfiability in propositional dependence logic
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.009openalex-snapshot
Characterising modal definability of team-based logics via the universal modality
inferred← citeshttps://doi.org/10.1016/j.ic.2016.07.008openalex-snapshot
Complexity of validity for propositional dependence logics
inferred← citeshttps://doi.org/10.1093/logcom/exz006openalex-snapshot
Uniform interpolation for propositional and modal team logics
inferred← citeshttps://doi.org/10.1093/logcom/exz008openalex-snapshot
Model checking and validity in propositional and modal inclusion logics
inferred← citeshttps://doi.org/10.1145/3157054openalex-snapshot
Complexity of Propositional Logics in Team Semantic
inferred← citeshttps://doi.org/10.1145/3356043openalex-snapshot
Satisfiability of Modal Inclusion Logic
inferred← citeshttps://doi.org/10.1215/00294527-2024-0027openalex-snapshot
State-Based Modal Logics for Free Choice
inferred← citeshttps://doi.org/10.23638/lmcs-15(2:2)2019openalex-snapshot
Canonical Models and the Complexity of Modal Team Logic
inferred← citeshttps://doi.org/10.23638/lmcs-15(2:4)2019openalex-snapshot
Validity and Entailment in Modal and Propositional Dependence Logics
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:17)2019openalex-snapshot
On the Succinctness of Atoms of Dependency
inferred← citeshttps://doi.org/10.26686/ajl.v22i2.5680openalex-snapshot
Possibility Frames and Forcing for Modal Logic
inferred← citeshttps://doi.org/10.4204/eptcs.193.10openalex-snapshot
The expressive power of modal logic with inclusion atoms
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.277openalex-snapshot
A Van Benthem Theorem for Modal Team Semantics
inferred← citeshttps://doi.org/10.46298/entics.14767openalex-snapshot
Two-dimensional Kripke Semantics II: Stability and Completeness
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.