A Finite Axiomatization for Fork Algebras (Q4340535)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1019585
Language Label Description Also known as
default for all languages
No label defined
    English
    A Finite Axiomatization for Fork Algebras
    scientific article; zbMATH DE number 1019585

      Statements

      A Finite Axiomatization for Fork Algebras (English)
      0 references
      26 October 1997
      0 references
      finite axiomatization
      0 references
      relation algebras
      0 references
      fork algebras
      0 references
      deriving programs from specifications
      0 references
      representability
      0 references
      finitely based variety
      0 references
      proper abstraction
      0 references
      From the authors' conclusions: Classes of proper fork algebras (PFA's) as well as their abstract counterpart (AFA's) have been found useful for deriving programs from specifications (\dots). The representability was established for (some) complete and atomistic classes (\dots). In this paper, we define a different class of PFA's and AFA's by removing previously used assumptions. We show that this class has the following properties: -- representability: every AFA is isomorphic to some PFA; -- finitely based variety: the closure of PFA's under isomorphism is axiomatizable by a finite number of equations; -- proper abstraction: every PFA is an AFA.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references