An effectively given initial semigroup
From MaRDI portal
Publication:1061863
DOI10.1007/BF00264231zbMath0571.20057MaRDI QIDQ1061863
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
recursive; conditionally complete and directed-set complete poset; free semigroup domains on finitely many generators
06A06: Partial orders, general
20M05: Free semigroups, generators and relations, word problems
68Q55: Semantics in the theory of computing
20M35: Semigroups in automata theory, linguistics, etc.
06F05: Ordered semigroups and monoids
03D45: Theory of numerations, effectively presented structures
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