On the public citation graph
Dynamic algebras which are not Kripke structures
0 signed · 25 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_83openalex-snapshot
A representation theorem for models of *-free PDL
inferredcites →https://doi.org/10.1007/3-540-11160-3_1openalex-snapshot
On the duality of dynamic algebras and kripke models
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
inferredcites →https://doi.org/10.1145/800135.804409openalex-snapshot
A completeness technique for d-axiomatizable semantics
inferredcites →https://doi.org/10.2307/2272694openalex-snapshot
A. Salwicki. Formalized algorithmic languages. English with English and Russian summaries. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 18 (1970), pp. 227–232, XVII, XVII. - A. Salwicki. On the equivalence of FS-expressions and…
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_6openalex-snapshot
On the Representation of Kleene Algebras with Tests
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_114openalex-snapshot
On representation of dynamic algebras with reversion
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_4openalex-snapshot
Propositional dynamic logics of programs: A survey
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_23openalex-snapshot
Filtration theorem for dynamic algebras with tests and inverse operator
inferred← citeshttps://doi.org/10.1007/bfb0022532openalex-snapshot
Axioms of algorithmic logic univocally determine semantics of programs
inferred← citeshttps://doi.org/10.1007/bfb0025788openalex-snapshot
The representation theorem for algorithmic algebras
inferred← citeshttps://doi.org/10.1007/bfb0030332openalex-snapshot
From dynamic algebras to test algebras
inferred← citeshttps://doi.org/10.1007/s000120050121openalex-snapshot
Separable Kripke structures are algebraically universal
inferred← citeshttps://doi.org/10.1007/s10849-007-9051-4openalex-snapshot
Strong Completeness and Limited Canonicity for PDL
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90014-6openalex-snapshot
Dynamic algebras with test
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70008-9openalex-snapshot
I. Bibliography of Cylindric Algebras and Related Algebraic Structures
inferred← citeshttps://doi.org/10.1109/ismvl68998.2026.00031openalex-snapshot
A Stone-type Representation Theorem for Star-free Dynamic Orthomodular Lattice
inferred← citeshttps://doi.org/10.21136/mb.1994.126082openalex-snapshot
Věra Trnková's unbelievable 60
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.