Effective codescent morphisms in the varieties determined by convergent term rewriting systems.

DOI10.1515/tmj-2016-0005zbMath1337.08004OpenAlexW2313026837MaRDI QIDQ278228

Guram Samsonadze, Dali Zangurashvili

Publication date: 2 May 2016

Published in: Tbilisi Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/tmj-2016-0005

zbMATH Keywords

amalgamated free productsconfluent term rewriting systemseffective codescent morphismsnormal forms of elementsvarieties of universal algebras

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Grammars and rewriting systems (68Q42) Epimorphisms, monomorphisms, special classes of morphisms, null morphisms (18A20) Products, amalgamated products, and other kinds of limits and colimits (08B25) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (1)

Admissible Galois structures on the categories dual to some varieties of universal algebras

Cites Work

• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Linear unification
• Facets of descent. I
• Facets of descent. III: Monadic descent for rings and algebras
• Effective codescent morphisms in some varieties of universal algebras
• On theories with a combinatorial definition of 'equivalence'
• Existence, Uniqueness, and Construction of Rewrite Systems
• An Efficient Unification Algorithm
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• Term Rewriting and All That
• Boolean algebra admits no convergent term rewriting system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Effective codescent morphisms in the varieties determined by convergent term rewriting systems.