Iterative factor algebras and induced metrics (Q790606): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3960142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular trees and the free iterative theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of iterative congruences of free iterative algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique fixed points vs. least fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877027 / rank
 
Normal rank

Latest revision as of 11:12, 14 June 2024

scientific article
Language Label Description Also known as
English
Iterative factor algebras and induced metrics
scientific article

    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

    Identifiers

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