On the public citation graph

Dynamic algebras: Examples, constructions, applications

https://doi.org/10.1007/bf00370685
0 signed · 108 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.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/3-540-08921-7_88openalex-snapshot
The completeness of propositional dynamic logic
inferredcites →https://doi.org/10.1007/3-540-10003-2_83openalex-snapshot
A representation theorem for models of *-free PDL
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10854-8_31openalex-snapshot
Dynamic algebras of programs
inferredcites →https://doi.org/10.1007/3-540-11160-3_1openalex-snapshot
On the duality of dynamic algebras and kripke models
inferredcites →https://doi.org/10.1007/3-540-11160-3_4openalex-snapshot
Propositional dynamic logics of programs: A survey
inferredcites →https://doi.org/10.1007/3-540-12896-4_370openalex-snapshot
A decision procedure for the propositional μ-calculus
inferredcites →https://doi.org/10.1007/978-1-4612-6264-0openalex-snapshot
Automata-Theoretic Aspects of Formal Power Series
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_10openalex-snapshot
Dynamic Logic
inferredcites →https://doi.org/10.1007/978-94-017-0462-5openalex-snapshot
Handbook of Philosophical Logic
inferredcites →https://doi.org/10.1007/bf00370324openalex-snapshot
Application of modal logic to programming
inferredcites →https://doi.org/10.1007/bf02125228openalex-snapshot
Some basic theorems of qualitative probability
inferredcites →https://doi.org/10.1007/bfb0018343openalex-snapshot
Temporal Structures
inferredcites →https://doi.org/10.1007/bfb0018436openalex-snapshot
Action logic and pure induction
inferredcites →https://doi.org/10.1007/bfb0025782openalex-snapshot
On induction vs. *-continuity
inferredcites →https://doi.org/10.1007/bfb0025792openalex-snapshot
Using graphs to understand PDL
inferredcites →https://doi.org/10.1007/bfb0043079openalex-snapshot
Dynamic algebras as a well-behaved fragment of relation algebras
inferredcites →https://doi.org/10.1016/0021-8693(81)90179-4openalex-snapshot
Boolean modules
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
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.1016/0022-0000(87)90014-6openalex-snapshot
Dynamic algebras with test
inferredcites →https://doi.org/10.1016/0304-3975(82)90030-5openalex-snapshot
Every free algebra in the variety generated by the representable dynamic algebras is separable and representable
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80014-xopenalex-snapshot
Heterogeneous algebras
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1080/00029890.1977.11994433openalex-snapshot
The Logic of Equality
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501865-8openalex-snapshot
The theory of representations for Boolean algebras
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/sfcs.1979.24openalex-snapshot
Models of program logics
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/567752.567761openalex-snapshot
Process logic
inferredcites →https://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferredcites →https://doi.org/10.1145/800141.804649openalex-snapshot
Dynamic algebras and the nature of induction
inferredcites →https://doi.org/10.1307/mmj/1028999131openalex-snapshot
On representable relation algebras.
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.2307/2268577openalex-snapshot
On the calculus of relations
inferredcites →https://doi.org/10.2307/2268661openalex-snapshot
On sentences which are true of direct unions of algebras
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/-9-1-31-46openalex-snapshot
A completeness theorem in the modal logic 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.1002/malq.200510022openalex-snapshot
Monadic dynamic algebras
inferred← citeshttps://doi.org/10.1002/malq.200910033openalex-snapshot
Subdirectly irreducible separable dynamic algebras
inferred← citeshttps://doi.org/10.1002/malq.201020058openalex-snapshot
Congruences and ideals on Peirce algebras: a heterogeneous/homogeneous point of view
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_42openalex-snapshot
Boolean and Fuzzy Relations
inferred← citeshttps://doi.org/10.1007/11964810_2openalex-snapshot
Investigating Finite Models of Non-classical Logics with Relation Algebra and RelView
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-11160-3_1openalex-snapshot
On the duality of dynamic algebras and kripke models
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_56openalex-snapshot
On the Equational Definition of the Least Prefixed Point
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_27openalex-snapshot
An Algebraic Approach to Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_53openalex-snapshot
Boolean and Fuzzy Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_15openalex-snapshot
Algebraic Derivation of Until Rules and Application to Timer Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_13openalex-snapshot
On the Complexity of Kleene Algebra with Domain
inferred← citeshttps://doi.org/10.1007/978-3-031-44490-6_8openalex-snapshot
Actions and Deontology: Janusz Czelakowski on Actions and their Assessment
inferred← citeshttps://doi.org/10.1007/978-3-319-73579-5openalex-snapshot
Dynamic Logic. New Trends and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-73579-5_10openalex-snapshot
Dynamic Logic: A Personal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_10openalex-snapshot
Kleene Modules
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_16openalex-snapshot
Non-termination in Idempotent Semirings
inferred← citeshttps://doi.org/10.1007/978-3-662-48561-3_21openalex-snapshot
Algebraic Semantics for Dynamic Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_3openalex-snapshot
Algebraic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_2openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bfb0025782openalex-snapshot
On induction vs. *-continuity
inferred← citeshttps://doi.org/10.1007/bfb0028021openalex-snapshot
Equational axioms of test algebra
inferred← citeshttps://doi.org/10.1007/bfb0043079openalex-snapshot
Dynamic algebras as a well-behaved fragment of relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-013-0223-6openalex-snapshot
Boolean-like algebras
inferred← citeshttps://doi.org/10.1007/s000120050121openalex-snapshot
Separable Kripke structures are algebraically universal
inferred← citeshttps://doi.org/10.1007/s000120050146openalex-snapshot
Separability and decidability results for varieties of J�nsson dynamic algebras
inferred← citeshttps://doi.org/10.1007/s00500-022-07281-8openalex-snapshot
Epistemic Łukasiewicz logic of partial knowledge
inferred← citeshttps://doi.org/10.1007/s10849-025-09447-7openalex-snapshot
Deontic Action Logics: A Modular Algebraic Perspective
inferred← citeshttps://doi.org/10.1007/s11225-013-9473-8openalex-snapshot
On the Dynamic Logic of Agency and Action
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90127-9openalex-snapshot
PDL with data constants
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90014-6openalex-snapshot
Dynamic algebras with test
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90126-0openalex-snapshot
Determinism and looping in combinatory PDL
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90279-8openalex-snapshot
On dynamic algebras
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferred← citeshttps://doi.org/10.1016/j.ijar.2020.06.003openalex-snapshot
Dynamic Łukasiewicz Logic and Dynamic MV-algebras
inferred← citeshttps://doi.org/10.1016/j.jal.2009.09.002openalex-snapshot
Complete axiomatizations for XPath fragments
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.11.001openalex-snapshot
Canonical finite models of Kleene algebra with tests
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.05.003openalex-snapshot
Completion of Boolean algebras in MSet
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.016openalex-snapshot
Algebraic notions of nontermination: Omega and divergence in idempotent semirings
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.019openalex-snapshot
Axiomatizability of representable domain algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.069openalex-snapshot
Algebras of modal operators and partial correctness
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.043openalex-snapshot
Linear and affine logics with temporal, spatial and epistemic operators
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.024openalex-snapshot
The equational theory of Kleene lattices
inferred← citeshttps://doi.org/10.1016/s0049-237x(03)80019-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00027-4openalex-snapshot
Complexity of equations valid in algebras of relations part I: Strong non-finitizability
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00412-7openalex-snapshot
On the equational definition of the least prefixed point
inferred← citeshttps://doi.org/10.1023/a:1004764610651openalex-snapshot
A Proof System for Contact Relation Algebras
inferred← citeshttps://doi.org/10.1090/s0002-9947-05-03816-xopenalex-snapshot
MacNeille completions and canonical extensions
inferred← citeshttps://doi.org/10.1093/jigpal/jzm014openalex-snapshot
Congruences on Dynamic Algebras
inferred← citeshttps://doi.org/10.1142/s0218196709005354openalex-snapshot
SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS
inferred← citeshttps://doi.org/10.1145/1166109.1166116openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.1145/1183278.1183285openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.1145/2785967openalex-snapshot
Concurrent Dynamic Algebra
inferred← citeshttps://doi.org/10.1145/800141.804648openalex-snapshot
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations
inferred← citeshttps://doi.org/10.1145/800141.804649openalex-snapshot
Dynamic algebras and the nature of induction
inferred← citeshttps://doi.org/10.2139/ssrn.7239517openalex-snapshot
A note on dynamic algebras
inferred← citeshttps://doi.org/10.2178/jsl/1190150141openalex-snapshot
PDL has interpolation
inferred← citeshttps://doi.org/10.29007/dzwkopenalex-snapshot
Boolean like algebras
inferred← citeshttps://doi.org/10.3166/jancl.20.139-171openalex-snapshot
Some modal aspects of XPath
inferred← citeshttps://doi.org/10.4204/eptcs.379.11openalex-snapshot
Epistemic Logics of Structured Intensional Groups
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:5)2021openalex-snapshot
Axiomatizing Hybrid XPath with Data
inferred← citeshttps://doi.org/10.70675/d369fcf0z8522z41eezac67z44f751da5b09openalex-snapshot
Algebras of Relations : from algorithms to formal proofs
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.