On the public citation graph
Nonstandard Dynamic Logic
0 signed · 41 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-10854-8_37openalex-snapshot
First order dynamic logic with decidable proofs and workable model theory
inferredcites →https://doi.org/10.1007/3-540-10856-4_82openalex-snapshot
A characterization of Floyd-provable programs
inferredcites →https://doi.org/10.1007/3-540-10856-4_95openalex-snapshot
Making dynamic logic first-order
inferredcites →https://doi.org/10.1007/3-540-11981-7_13openalex-snapshot
Nonstandard runs of Floyd-provable programs
inferredcites →https://doi.org/10.1007/978-94-015-7642-0openalex-snapshot
Model Theory for Modal Logic
inferredcites →https://doi.org/10.1016/0304-3975(82)90004-4openalex-snapshot
A complete logic for reasoning about programs via nonstandard model theory I
inferredcites →https://doi.org/10.1016/s0019-9958(75)90415-5openalex-snapshot
On the termination of program schemas
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
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.19840303102openalex-snapshot
STRUCTURED NONSTANDARD DYNAMIC LOGIC
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_1openalex-snapshot
Sharpening the characterization of the power of Floyd method
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_11openalex-snapshot
A formal system for parallel programs in discrete time and space
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_13openalex-snapshot
Nonstandard runs of Floyd-provable programs
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_24openalex-snapshot
The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods
inferred← citeshttps://doi.org/10.1007/3-540-16066-3_21openalex-snapshot
Extension of PDL and consequence relations
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_78openalex-snapshot
Nonstandard logics of recursive programs and denotational semantics
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_48openalex-snapshot
A streamlined temporal completeness theorem
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_31openalex-snapshot
Past proves more invariance properties but not pca's
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_11openalex-snapshot
Logic of Space-Time and Relativity Theory
inferred← citeshttps://doi.org/10.1007/978-94-015-8533-0_6openalex-snapshot
Implicit and Explicit Definability in Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/bf00370557openalex-snapshot
Is ?some-other-time? sometimes better than ?sometime? for proving partial correctness of programs?
inferred← citeshttps://doi.org/10.1007/bf00971204openalex-snapshot
Temporal logics with “the next” operator do not have interpolation or the Beth property
inferred← citeshttps://doi.org/10.1007/bfb0015752openalex-snapshot
Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem
inferred← citeshttps://doi.org/10.1007/bfb0028786openalex-snapshot
A unifying theorem for algebraic semantics and dynamic logics
inferred← citeshttps://doi.org/10.1007/bfb0040269openalex-snapshot
Does “N+1 times” prove more programs correct than “N times”?
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90148-7openalex-snapshot
Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90024-6openalex-snapshot
A simple proof for the completeness of Floyd's method
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90118-6openalex-snapshot
Total correctness in nonstandard logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90138-2openalex-snapshot
The power of temporal proofs
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90156-4openalex-snapshot
Weak second order characterizations of various program verification systems
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90156-copenalex-snapshot
Recursive programs and denotational semantics in absolute logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90386-gopenalex-snapshot
On the strength of temporal proofs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90067-popenalex-snapshot
Temporal logics need their clocks
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)80042-4openalex-snapshot
On the strength of “sometimes” and “always” in program verification
inferred← citeshttps://doi.org/10.1016/s0747-7171(86)80013-xopenalex-snapshot
Non-standard algorithmic and dynamic logic
inferred← citeshttps://doi.org/10.1080/11663081.1991.10510772openalex-snapshot
Temporal logics of “the next” do not have the beth property
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635239openalex-snapshot
An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870760openalex-snapshot
A completeness theorem for dynamic logic.
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.