Elsevier

Theoretical Computer Science

Volume 293, Issue 1, 3 February 2003, Pages 169-188
Theoretical Computer Science

The max-plus algebra of the natural numbers has no finite equational basis

https://doi.org/10.1016/S0304-3975(02)00236-0Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper shows that the collection of identities which hold in the algebra N of the natural numbers with constant zero, and binary operations of sum and maximum is not finitely based. Moreover, it is proven that, for every n, the equations in at most n variables that hold in N do not form an equational basis. As a stepping stone in the proof of these facts, several results of independent interest are obtained. In particular, explicit descriptions of the free algebras in the variety generated by N are offered. Such descriptions are based upon a geometric characterization of the equations that hold in N, which also yields that the equational theory of N is decidable in exponential time.

MSC

08A70
03C05
68Q15
68Q70

PACS

D.3.1
F.1.1
F.4.1

Keywords

Equational logic
Varieties
Complete axiomatizations
Exponential time complexity

Cited by (0)

1

Partially supported by research grants from the National Foundation of Hungary for Scientific Research (Grant No. T30511) and the Fukushima Prefecture.

2

Supported by a research grant from the Danish Research Council.