Iterative factor algebras and induced metrics (Q790606)
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 3848591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative factor algebras and induced metrics |
scientific article; zbMATH DE number 3848591 |
Statements
Iterative factor algebras and induced metrics (English)
0 references
1984
0 references
Iterative theories were introduced by \textit{C. C. Elgot} to study the semantics of flowchart algorithms [Logic Colloquium '73, Proc., Bristol 1973, 175-230 (1975; Zbl 0327.02040)]. These theories may also be studied in the form of algebras in which every nontrival system of fixed point equations has a unique solution. It was shown by the reviewer [Universal algebra and applications, Semester 1978, Banach Center Publ. 9. 209-224 (1982; Zbl 0516.18007)] that all of the standard examples of iterative theories could be equipped with complete metrics so that the non-trivial polynomials induced contraction mappings. In particular, the free iterative theories, which may be represented as regular trees have this property. The present paper gives a necessary and sufficient condition for a congruence K on a free theory R to have the property that R/K is again an iterative theory.
0 references
semantics of programming languages
0 references
flowchart algorithms
0 references
fixed point semantics
0 references
fixed point equations
0 references
iterative theories
0 references
complete metrics
0 references
regular trees
0 references
free theory
0 references
0.8422120809555054
0 references
0.8405221700668335
0 references
0.8315240740776062
0 references
0.8286110162734985
0 references
0.8265808820724487
0 references