On the public citation graph

Dynamic algebras as a well-behaved fragment of relation algebras

https://doi.org/10.1007/bfb0043079
0 signed · 85 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/3-540-12896-4_370openalex-snapshot
A decision procedure for the propositional μ-calculus
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4899-3558-8_32openalex-snapshot
Residuated Lattices
inferredcites →https://doi.org/10.1007/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf02483728openalex-snapshot
Varieties of relation algebras
inferredcites →https://doi.org/10.1007/bfb0018343openalex-snapshot
Temporal Structures
inferredcites →https://doi.org/10.1007/bfb0025782openalex-snapshot
On induction vs. *-continuity
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/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/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(88)90014-4openalex-snapshot
A satisfiability tester for non-clausal propositional calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)71099-1openalex-snapshot
Ultraproducts for Algebraists
inferredcites →https://doi.org/10.1016/s1385-7258(55)50009-6openalex-snapshot
Contributions to the theory of models. III
inferredcites →https://doi.org/10.1017/cbo9781107280991.006openalex-snapshot
On the Syllogism
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1090/coll/041openalex-snapshot
A Formalization of Set Theory without Variables
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.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/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
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/1969375openalex-snapshot
The Representation of Relational Algebras
inferredcites →https://doi.org/10.2307/1989664openalex-snapshot
The Theory of Representation for Boolean Algebras
inferredcites →https://doi.org/10.2307/1989931openalex-snapshot
Non-Commutative Residuated Lattices
inferredcites →https://doi.org/10.2307/2266341openalex-snapshot
Louise H. Chin and Alfred Tarski. Distributive and modular laws in the arithmetic of relation algebras. University of California publications in mathematics, n.s. vol. 1 no. 9 (1951), pp. 341–384.
inferredcites →https://doi.org/10.2307/2268420openalex-snapshot
Alfred Tarski. Contributions to the theory of models. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 57 (1954), pp. 572–588, and vol. 58 (1955), pp. 56–64; also Indagationes mathematicae, vol. 16 (1954), pp. 572–588, and vol. 17 (1955), pp. 56–64.
inferredcites →https://doi.org/10.2307/2268577openalex-snapshot
On the calculus of relations
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.2307/2372074openalex-snapshot
Boolean Algebras with Operators
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.2307/25058006openalex-snapshot
Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole's Calculus of Logic
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.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-46766-1_1openalex-snapshot
A Calculus for Access Control in Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_190openalex-snapshot
Rational mechanics and natural mathematics
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_40openalex-snapshot
Cut-free display calculi for relation algebras
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-1-4471-3573-9_2openalex-snapshot
Dynamic Algebra for Calculating Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_24openalex-snapshot
A String Diagrammatic Axiomatisation of Finite-State Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_19openalex-snapshot
Modal Kleene Algebra Applied to Program Correctness
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_10openalex-snapshot
Kleene Modules
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_9openalex-snapshot
Pointer Kleene Algebra
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/978-94-017-0697-1_6openalex-snapshot
A Survey of Boolean Algebras with Operators
inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferred← citeshttps://doi.org/10.1007/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferred← citeshttps://doi.org/10.1007/bf01066355openalex-snapshot
Lambek Calculus and its relational semantics: Completeness and incompleteness
inferred← citeshttps://doi.org/10.1007/bf01190768openalex-snapshot
Notes on equational theories of relations
inferred← citeshttps://doi.org/10.1007/bf01215410openalex-snapshot
Peirce algebras
inferred← citeshttps://doi.org/10.1007/bfb0018436openalex-snapshot
Action logic and pure induction
inferred← citeshttps://doi.org/10.1007/bfb0023771openalex-snapshot
Towards Kleene Algebra with recursion
inferred← citeshttps://doi.org/10.1007/bfb0028021openalex-snapshot
Equational axioms of test algebra
inferred← citeshttps://doi.org/10.1007/bfb0029594openalex-snapshot
On kleene algebras and closed semirings
inferred← citeshttps://doi.org/10.1007/s00500-008-0384-yopenalex-snapshot
Inductive semimodules and the vector modules over them
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/j.jlamp.2014.08.007openalex-snapshot
Monoids with tests and the algebra of possibly non-halting programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00156-5openalex-snapshot
A relation – algebraic approach to the region connection calculus
inferred← citeshttps://doi.org/10.1017/s1755020319000224openalex-snapshot
NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS
inferred← citeshttps://doi.org/10.1023/a:1004295308014openalex-snapshot
A System of Dynamic Modal Logic
inferred← citeshttps://doi.org/10.1023/a:1013892110192openalex-snapshot
A Necessary Relation Algebra for Mereotopology
inferred← citeshttps://doi.org/10.1023/b:jlli.0000028336.64373.f6openalex-snapshot
Logics for Classes of Boolean Monoids
inferred← citeshttps://doi.org/10.1080/11663081.1993.10510805openalex-snapshot
Dynamic logic with program specifications and its relational proof system
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.1142/s0218196711006844openalex-snapshot
MODAL RESTRICTION SEMIGROUPS: TOWARDS AN ALGEBRA OF FUNCTIONS
inferred← citeshttps://doi.org/10.1145/1183278.1183285openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.1145/155183.155225openalex-snapshot
A calculus for access control in distributed systems
inferred← citeshttps://doi.org/10.12775/llp.2016.017openalex-snapshot
Distributed Relation Logic
inferred← citeshttps://doi.org/10.2178/jsl.7704090openalex-snapshot
Undecidability of representability as binary relations
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cb7openalex-snapshot
A String Diagrammatic Axiomatisation of Finite-State Automata
inferred← citeshttps://doi.org/10.4204/eptcs.421.8openalex-snapshot
Paraconsistent Relations as a Variant of Kleene Algebras
inferred← citeshttps://doi.org/10.7146/dpb.v21i381.6613openalex-snapshot
On Action Algebras
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.