On the public citation graph

Decision complexity of variants of propositional dynamic logic

https://doi.org/10.1007/bfb0022540
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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07389-2_183openalex-snapshot
Parallel recursive program schemes
inferredcites →https://doi.org/10.1007/3-540-09526-8_48openalex-snapshot
On axiomatization of deterministic propositional dynamic logic
inferredcites →https://doi.org/10.1007/bfb0022461openalex-snapshot
Modal logic of concurrent nondeterministic programs
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0022-0000(80)90061-6openalex-snapshot
A near-optimal method for reasoning about action
inferredcites →https://doi.org/10.1109/sfcs.1978.2openalex-snapshot
A decidability result for a second order process logic
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferredcites →https://doi.org/10.1145/800113.803636openalex-snapshot
An algebraic system for process structuring and interprocess communication
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
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/3-540-10843-2_21openalex-snapshot
Finite models for deterministic propositional dynamic logic
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_22openalex-snapshot
On axiomatization of process logic
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_6openalex-snapshot
On four logics of programs and complexity of their satisfiability problems : Extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_10openalex-snapshot
Model theory of propositional logics of programs, some open problems
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_20openalex-snapshot
Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_9openalex-snapshot
Non-Deterministic Program Schemata and Their Relation to Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-6259-0_10openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_2openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bf01132079openalex-snapshot
Nondeterministic program schemata and their relation to dynamic logic
inferred← citeshttps://doi.org/10.1007/s10817-020-09544-1openalex-snapshot
Loop-Type Sequent Calculi for Temporal Logic
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90018-6openalex-snapshot
Deterministic propositional dynamic logic: Finite models, complexity, and completeness
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90083-2openalex-snapshot
On the computational complexity of satisfiability in propositional logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90347-vopenalex-snapshot
∏11-universality of some propositional logics of concurrent programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1134/s036176881604006xopenalex-snapshot
Program schemata technique for propositional program logics: A 30-year history
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.