On the public citation graph
Reasoning about knowledge on computation trees
0 signed · 32 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/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-15648-8_21openalex-snapshot
Distributed processes and the logic of knowledge
inferredcites →https://doi.org/10.1007/3-540-58095-6_11openalex-snapshot
Knowledge theoretic properties of topological spaces
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/978-94-009-2647-9_2openalex-snapshot
Reasoning about Knowledge in Philosophy: The Paradigm of Epistemic Logic
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_3openalex-snapshot
Combinations of Tense and Modality
inferredcites →https://doi.org/10.1007/978-94-009-9117-0_16openalex-snapshot
A Temporal Framework for Conditionals and Chance
inferredcites →https://doi.org/10.1007/978-94-017-0462-5_3openalex-snapshot
Combinations of Tense and Modality
inferredcites →https://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferredcites →https://doi.org/10.1016/0022-0000(89)90039-1openalex-snapshot
The complexity of reasoning about knowledge and time. I. Lower bounds
inferredcites →https://doi.org/10.1016/b978-0-934613-04-0.50007-7openalex-snapshot
REASONING ABOUT KNOWLEDGE IN PHILOSOPHY: THE PARADIGM OF EPISTEMIC LOGIC
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
inferredcites →https://doi.org/10.1145/12130.12161openalex-snapshot
The complexity of reasoning about knowledge and time
inferredcites →https://doi.org/10.1145/800222.806735openalex-snapshot
Knowledge and common knowledge in a distributed environment
inferredcites →https://doi.org/10.2307/2275086openalex-snapshot
Steven Vickers. Topology via logic. Cambridge tracts in theoretical computer science, no. 5. Cambridge University Press, Cambridge etc. 1989, xiii + 200 pp.
inferredcites →https://doi.org/10.48550/arxiv.cs/0007038openalex-snapshot
Modal Logics for Topological Spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19970430205openalex-snapshot
On Binary Computation Structures
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_12openalex-snapshot
Separating Sets by Modal Formulas
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_16openalex-snapshot
On the complexity of prefix formulas in modal logic of subset spaces
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_6openalex-snapshot
Topology and Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_12openalex-snapshot
Structures for Epistemic Logic
inferred← citeshttps://doi.org/10.1007/bfb0029972openalex-snapshot
A topological generalization of propositional linear time temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0035630openalex-snapshot
A modal logic for reasoning about knowledge and time on binary subset trees
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00016-xopenalex-snapshot
Topological reasoning and the logic of knowledge
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00310-7openalex-snapshot
Temporal aspects of the modal logic of subset spaces
inferred← citeshttps://doi.org/10.1023/a:1016372523344openalex-snapshot
Completeness of Certain Bimodal Logics for Subset Spaces
inferred← citeshttps://doi.org/10.3233/fi-1999-39303openalex-snapshot
The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees
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.