An effectively given initial semigroup

DOI10.1007/BF00264231zbMath0571.20057OpenAlexW1993100546MaRDI QIDQ1061863

Tsutomu Kamimura

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264231

zbMATH Keywords

recursiveconditionally complete and directed-set complete posetfree semigroup domains on finitely many generators

Mathematics Subject Classification ID

Partial orders, general (06A06) Free semigroups, generators and relations, word problems (20M05) Semantics in the theory of computing (68Q55) Semigroups in automata theory, linguistics, etc. (20M35) Ordered semigroups and monoids (06F05) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic relations and presentations
• Effectively given domains
• Tree constructions of free continuous algebras
• Varieties of ordered algebras
• Bottom-up and top-down tree transformations— a comparison
• Data Types as Lattices
• Initial Algebra Semantics and Continuous Algebras
• Proof theory

This page was built for publication: An effectively given initial semigroup