The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 101 – 120 of 987

Showing per page

A conjecture on the concatenation product

Jean-Eric Pin, Pascal Weil (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal’cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general case. Another...

A conjecture on the concatenation product

Jean-Eric Pin, Pascal Weil (2010)

RAIRO - Theoretical Informatics and Applications

In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal'cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general case....

A constructive proof that every 3-generated l-group is ultrasimplicial

Daniele Mundici, Giovanni Panti (1999)

Banach Center Publications

We discuss the ultrasimplicial property of lattice-ordered abelian groups and their associated MV-algebras. We give a constructive proof of the fact that every lattice-ordered abelian group generated by three elements is ultrasimplicial.

Currently displaying 101 – 120 of 987