OpenLink Software

About: In this paper we consider two classes of posets labeled over an alphabet A. The class [Formula: see text] is built from the letters and closed under the operations of series finite, [Formula: see text] and [Formula: see text] products, and finite parallel product. In the class [Formula: see text], [Formula: see text] and [Formula: see text] products are replaced by [Formula: see text] and [Formula: see text] powers. We prove that [Formula: see text] and [Formula: see text] are freely generated in their respective natural varieties of algebras [Formula: see text] and [Formula: see text], and that the equational theory of [Formula: see text] is decidable.

 Permalink

an Entity references as follows:

Faceted Search & Find service v1.13.91

Alternative Linked Data Documents: Sponger | ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Copyright © 2009-2025 OpenLink Software