On the equational definition of the least prefixed point.

DOI10.1016/S0304-3975(02)00412-7zbMath1045.68088OpenAlexW1993035157MaRDI QIDQ1401250

Luigi Santocanale

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00412-7

zbMATH Keywords

Temporal logicFixed point calculiLeast fixed pointSemantics and logics of programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (4)

Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Completeness for flat modal fixpoint logics ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Completions of \(\mu \)-algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and the completeness of the modal \(\mu\)-calculus
• Iterative algebras
• Results on the propositional \(\mu\)-calculus
• Equational properties of iteration in algebraically complete categories
• Duality for modal \(\mu\)-logics
• Complete systems of \(\mathcal B\)-rational identities
• Dynamic algebras: Examples, constructions, applications
• Varieties of ordered algebras
• The modal mu-calculus alternation hierarchy is strict
• Group axioms for iteration
• A completeness theorem for Kleene algebras and the algebra of regular events
• Completeness of Park induction
• An equational variant of Lawvere's natural numbers object
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Matrix and matricial iteration theories. I
• A fixpoint theorem for complete categories
• Free lattices. II
• Une remarque sur les systèmes complets d'identités rationnelles
• Equational axioms for regular sets
• Une condition impliquant toutes les identités rationnelles
• Monadic Logic of Order over Naturals has no Finite Base
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Two Complete Axiom Systems for the Algebra of Regular Events
• Rudiments of \(\mu\)-calculus
• Free \(\mu\)-lattices

This page was built for publication: On the equational definition of the least prefixed point.