On the public citation graph

On the power of nondeterminism in dynamic logic

https://doi.org/10.1007/bfb0012756
0 signed · 30 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-09237-4openalex-snapshot
First-Order Dynamic Logic
inferredcites →https://doi.org/10.1007/bfb0025787openalex-snapshot
A note on equivalences among logics of programs
inferredcites →https://doi.org/10.1016/0304-3975(83)90097-xopenalex-snapshot
The propositional dynamic logic of deterministic, well-structured programs
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/sfcs.1981.49openalex-snapshot
The prepositional dynamic logic of deterministic, well-structured programs
inferredcites →https://doi.org/10.1145/800135.804410openalex-snapshot
On the expressive power of Dynamic Logic (Preliminary Report)
inferredcites →https://doi.org/10.2307/2273958openalex-snapshot
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs.…

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-12689-9_130openalex-snapshot
Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_181openalex-snapshot
First steps towards a theory of complexity over more general data structures
inferred← citeshttps://doi.org/10.1007/978-94-009-6259-0_10openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bf00970010openalex-snapshot
A nondeterministic program logic
inferred← citeshttps://doi.org/10.1007/bf00970872openalex-snapshot
Role of determinism in query languages for data bases
inferred← citeshttps://doi.org/10.1007/bfb0016242openalex-snapshot
Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs
inferred← citeshttps://doi.org/10.1007/bfb0030337openalex-snapshot
Remarks on comparing expressive power of logics of programs
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90090-0openalex-snapshot
The unwind property for programs with bounded memory
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90027-8openalex-snapshot
Equivalences among logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90052-7openalex-snapshot
Some relationships between logics of programs and complexity theory
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90025-4openalex-snapshot
A simplified proof of DDL < DL
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80024-2openalex-snapshot
Deterministic dynamic logic is strictly weaker than dynamic logic
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80057-6openalex-snapshot
Nontrivial definability by flow-chart programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80002-4openalex-snapshot
Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71821-4openalex-snapshot
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70165-xopenalex-snapshot
The Pebble Game and Logics of Programs
inferred← citeshttps://doi.org/10.1070/rm1989v044n01abeh002007openalex-snapshot
Some open questions in the theory of program schemes and dynamic logics
inferred← citeshttps://doi.org/10.1070/sm1990v066n02abeh001315openalex-snapshot
ON DYNAMIC THEORIES OF FREE ALGEBRAS
inferred← citeshttps://doi.org/10.1109/lics.1989.39187openalex-snapshot
Some complexity bounds for dynamic logics
inferred← citeshttps://doi.org/10.1109/sfcs.1983.71openalex-snapshot
Some relationships between logics of programs and complexity theory
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.