On the public citation graph
Sequential method in propositional dynamic logic
0 signed · 43 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-08921-7_88openalex-snapshot
The completeness of propositional dynamic logic
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bfb0079559openalex-snapshot
Comments on gentzen-type procedures and the classical notion of truth
inferredcites →https://doi.org/10.1090/notiopenalex-snapshot
Notices of the American Mathematical Society
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferredcites →https://doi.org/10.1145/800105.803416openalex-snapshot
Computability and completeness in logics of programs (Preliminary Report)
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
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.2977/prims/1195187208openalex-snapshot
A Study of Some Tense Logics by Gentzen's Sequential Method
inferredcites →https://doi.org/10.2977/prims/1195189814openalex-snapshot
A Study of Kripke-type Models for Some Modal Logics by Gentzen's Sequential Method
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.19920380107openalex-snapshot
CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_83openalex-snapshot
A representation theorem for models of *-free PDL
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_111openalex-snapshot
Proof theoretic methodology for 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-53414-8_52openalex-snapshot
Decision procedure for checking validity of PAL formulas
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_6openalex-snapshot
Sequential Calculi for Symmetric Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-65840-3_9openalex-snapshot
Constructive Dynamic Logic of Relation Changers
inferred← citeshttps://doi.org/10.1007/978-3-540-76837-1_65openalex-snapshot
Parallel First-Order Dynamic Logic and Its Expressiveness and Axiomatization
inferred← citeshttps://doi.org/10.1007/bfb0026305openalex-snapshot
Gentzen-Systems for propositional temporal logics
inferred← citeshttps://doi.org/10.1007/bfb0029648openalex-snapshot
Gentzen type axiomatization for PAL
inferred← citeshttps://doi.org/10.1007/s10817-020-09544-1openalex-snapshot
Loop-Type Sequent Calculi for Temporal Logic
inferred← citeshttps://doi.org/10.1007/s10849-009-9101-1openalex-snapshot
Dynamic Non-Commutative Logic
inferred← citeshttps://doi.org/10.1007/s10986-006-0033-zopenalex-snapshot
A sequent calculus for logic of knowledge and past time: Completeness and decidability
inferred← citeshttps://doi.org/10.1007/s11225-010-9224-zopenalex-snapshot
A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic
inferred← citeshttps://doi.org/10.1007/s11225-026-10263-8openalex-snapshot
Craig Interpolation of Indexed Tense Logics via Analytic Sequent Calculi
inferred← citeshttps://doi.org/10.1016/0165-0114(94)90348-4openalex-snapshot
A sequential formulation of a logic based on fuzzy modalities
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90019-0openalex-snapshot
An elementary proof of the completeness of PDL
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90363-xopenalex-snapshot
Gentzen-type axiomatization for PAL
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1093/jigpal/jzz022openalex-snapshot
A proof-search system for the logic of likelihood
inferred← citeshttps://doi.org/10.1093/logcom/exac013openalex-snapshot
Three faces of recursion axioms: the case of constructive dynamic logic of relation changers
inferred← citeshttps://doi.org/10.2977/prims/1195183579openalex-snapshot
Semantical Analysis of Constructive PDL
inferred← citeshttps://doi.org/10.3166/jancl.14.55-104openalex-snapshot
A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
inferred← citeshttps://doi.org/10.4216/jpssj.45.17openalex-snapshot
Formalization of Counterfactual Inference by 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.