Previous Page 37

Displaying 721 – 724 of 724

Showing per page

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2004)

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

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.

Axiomatizing omega and omega-op powers of words

Stephen L. Bloom, Zoltán Ésik (2010)

RAIRO - Theoretical Informatics and Applications

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.

Axiomatizing quantum MV-algebras.

Roberto Giuntini (1997)

Mathware and Soft Computing

We introduce the notion of p-ideal of a QMV-algebra and we prove that the class of all p-ideals of a QMV-algebra M is in one-to-one correspondence with the class of all congruence relations of M.

Axioms which imply GCH

Jan Mycielski (2003)

Fundamenta Mathematicae

We propose some new set-theoretic axioms which imply the generalized continuum hypothesis, and we discuss some of their consequences.

Currently displaying 721 – 724 of 724

Previous Page 37