On the public citation graph
A note on equivalences among logics of programs
0 signed · 38 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-10843-2openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/3-540-11160-3_7openalex-snapshot
A survey of the logic of effective definitions
inferredcites →https://doi.org/10.1007/978-3-662-21545-6openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/bf01705528openalex-snapshot
Algorithmic properties of structures
inferredcites →https://doi.org/10.1007/bfb0023017openalex-snapshot
Theory of Program Structures: Schemes, Semantics, Verification
inferredcites →https://doi.org/10.1016/0022-0000(81)90016-7openalex-snapshot
Definability in dynamic logic
inferredcites →https://doi.org/10.1016/0304-3975(76)90022-0openalex-snapshot
Finiteness is mu-ineffable
inferredcites →https://doi.org/10.1016/0304-3975(81)90039-6openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: semantics and correctness I
inferredcites →https://doi.org/10.1016/s0022-0000(74)80030-9openalex-snapshot
Translatability of schemas over restricted interpretations
inferredcites →https://doi.org/10.1016/s0049-237x(08)71963-3openalex-snapshot
Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.1016/s0304-3975(81)80001-1openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/sfcs.1981.54openalex-snapshot
Unbounded program memory adds to the expressive power of first-order dynamic logic
inferredcites →https://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferredcites →https://doi.org/10.1145/567446.567466openalex-snapshot
Axiomatic definitions of programming languages
inferredcites →https://doi.org/10.1145/800105.803416openalex-snapshot
Computability and completeness in logics of programs (Preliminary Report)
inferredcites →https://doi.org/10.1145/800135.804410openalex-snapshot
On the expressive power of Dynamic Logic (Preliminary Report)
inferredcites →https://doi.org/10.1145/800141.804648openalex-snapshot
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations
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…
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.…
inferredcites →https://doi.org/10.4064/-2-1-7-99openalex-snapshot
An introduction to algorithmic logic. Metamathematical investigations in the theory of 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/bfb0012756openalex-snapshot
On the power of nondeterminism in dynamic logic
inferred← citeshttps://doi.org/10.1007/bfb0012779openalex-snapshot
A programming language for the inductive sets, and applications
inferred← citeshttps://doi.org/10.1007/bfb0030337openalex-snapshot
Remarks on comparing expressive power of logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90097-xopenalex-snapshot
The propositional dynamic logic of deterministic, well-structured programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/j.apal.2003.10.013openalex-snapshot
Computational inductive definability
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80020-0openalex-snapshot
Unbounded program memory adds to the expressive power of first-order programming logic
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80045-5openalex-snapshot
A programming language for the inductive sets, and applications
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.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.