On the public citation graph

On induction vs. *-continuity

https://doi.org/10.1007/bfb0025782
0 signed · 55 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-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-11160-3_1openalex-snapshot
On the duality of dynamic algebras and kripke models
inferredcites →https://doi.org/10.1007/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferredcites →https://doi.org/10.1007/bfb0022530openalex-snapshot
Dynamic algebras which are not Kripke structures
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0304-3975(81)90019-0openalex-snapshot
An elementary proof of the completeness of PDL
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.1109/sfcs.1979.24openalex-snapshot
Models of program logics
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/800141.804649openalex-snapshot
Dynamic algebras and the nature of induction
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.19840303102openalex-snapshot
STRUCTURED NONSTANDARD DYNAMIC LOGIC
inferred← citeshttps://doi.org/10.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferred← citeshttps://doi.org/10.1006/inco.2001.2960openalex-snapshot
On the Complexity of Reasoning in Kleene Algebra
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_4openalex-snapshot
Propositional dynamic logics of programs: A survey
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-19020-1_5openalex-snapshot
Assertional categories
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_3openalex-snapshot
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_38openalex-snapshot
Certification of Compiler Optimizations Using Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_35openalex-snapshot
Kleene algebra with tests and commutativity conditions
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_43openalex-snapshot
Kleene algebra with tests: Completeness and decidability
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_2openalex-snapshot
C-Dioids and $$\mu $$-Continuous Chomsky-Algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_18openalex-snapshot
PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-031-62687-6_7openalex-snapshot
Syntactic Concept Lattice Models for Infinitary Action Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_11openalex-snapshot
The Categories of Kleene Algebras, Action Algebras and Action Lattices Are Related by Adjunctions
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_7openalex-snapshot
Composing Partially Ordered Monads
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_25openalex-snapshot
Freshness and Name-Restriction in Sets of Traces with Names
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/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferred← citeshttps://doi.org/10.1007/bf01225472openalex-snapshot
The equational theory of union-free algebras of relations
inferred← citeshttps://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0028021openalex-snapshot
Equational axioms of test algebra
inferred← citeshttps://doi.org/10.1007/bfb0028786openalex-snapshot
A unifying theorem for algebraic semantics and dynamic logics
inferred← citeshttps://doi.org/10.1007/bfb0029594openalex-snapshot
On kleene algebras and closed semirings
inferred← citeshttps://doi.org/10.1007/bfb0043079openalex-snapshot
Dynamic algebras as a well-behaved fragment of relation algebras
inferred← citeshttps://doi.org/10.1007/s00500-008-0384-yopenalex-snapshot
Inductive semimodules and the vector modules over them
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90014-6openalex-snapshot
Dynamic algebras with test
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90083-eopenalex-snapshot
On models for propositional dynamic logic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80010-7openalex-snapshot
Rewriting extended regular expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80024-4openalex-snapshot
Rewriting extended regular expressions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.016openalex-snapshot
A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.004openalex-snapshot
Kleene modules and linear languages
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.1017/s0960129500000104openalex-snapshot
Equational axioms for regular sets
inferred← citeshttps://doi.org/10.1017/s0960129522000329openalex-snapshot
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem
inferred← citeshttps://doi.org/10.1109/lics.1991.151646openalex-snapshot
A completeness theorem for Kleene algebras and the algebra of regular events
inferred← citeshttps://doi.org/10.1109/lics.1997.614947openalex-snapshot
On the complexity of reasoning in Kleene algebra
inferred← citeshttps://doi.org/10.1109/tr.2021.3116054openalex-snapshot
Transition Algebra for Software Testing
inferred← citeshttps://doi.org/10.1145/256167.256195openalex-snapshot
Kleene algebra with tests
inferred← citeshttps://doi.org/10.3233/fi-2017-1469openalex-snapshot
Infinitary Axiomatization of the Equational Theory of Context-Free Languages
inferred← citeshttps://doi.org/10.7146/dpb.v21i381.6613openalex-snapshot
On Action Algebras
inferred← citeshttps://doi.org/10.7146/dpb.v22i461.6934openalex-snapshot
Rewriting Extended Regular Expressions
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.