Axiomatizing the least fixed point operation and binary supremum
From MaRDI portal
Recommendations
- Fixed point theorems of binary contraction comparable operators and an application
- The minimization of axiom sets characterizing generalized approximation operators
- Incorporating generalised quantifiers and the least fixed point operator
- scientific article; zbMATH DE number 124020
- A characterization of the least-fixed-point operator by dinaturality
- scientific article; zbMATH DE number 1923098
- Constructive proofs of fixed point theorems for set valued operators by simplicial algorithms
Cited in
(12)- On the equational definition of the least prefixed point.
- Equational theories for automata
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- A connection between concurrency and language theory
- Equational properties of fixed point operations in Cartesian categories: an overview
- Equational properties of stratified least fixed points (extended abstract)
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- Residuated Park theories
- On the equational definition of the least prefixed point
- scientific article; zbMATH DE number 7437711 (Why is no real title available?)
- Equational properties of fixed-point operations in Cartesian categories: an overview
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
This page was built for publication: Axiomatizing the least fixed point operation and binary supremum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753681)