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. Udgivelsesdato: FEB
A finite algebra of finite type (i.e. in a finite language) is finitely based iff the variety it gen...
Original article can be found at : http://www.sciencedirect.com/ Copyright Elsevier [Full text of th...
In this report we present some results on decidability, undecidability, semi-decidability, and non-s...
AbstractThis paper shows that the collection of identities which hold in the algebra N of the natura...
AbstractThis paper shows that the collection of identities which hold in the algebra N of the natura...
This paper shows that the collection of identities which hold inthe algebra N of the natural numbers...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
Does every finite algebraic system A with finitely many operations possess a finite list of polynomi...
An algebra is a set of elements equipped with some finitary operations represented by a selected set...
AbstractDoes every finite algebraic system A with finitely many operations possess a finite list of ...
AbstractAlgebras of commutative languages consist of all subsets of a free commutative monoid over a...
International audienceIn 1969, Tarski asked whether the arithmetic identities taught in high school ...
AbstractIn a paper published in J. ACM in 1990, Tobias Nipkow asserted that the problem of deciding ...
A finite algebra of finite type (i.e. in a finite language) is finitely based iff the variety it gen...
A finite algebra of finite type (i.e. in a finite language) is finitely based iff the variety it gen...
Original article can be found at : http://www.sciencedirect.com/ Copyright Elsevier [Full text of th...
In this report we present some results on decidability, undecidability, semi-decidability, and non-s...
AbstractThis paper shows that the collection of identities which hold in the algebra N of the natura...
AbstractThis paper shows that the collection of identities which hold in the algebra N of the natura...
This paper shows that the collection of identities which hold inthe algebra N of the natural numbers...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
Does every finite algebraic system A with finitely many operations possess a finite list of polynomi...
An algebra is a set of elements equipped with some finitary operations represented by a selected set...
AbstractDoes every finite algebraic system A with finitely many operations possess a finite list of ...
AbstractAlgebras of commutative languages consist of all subsets of a free commutative monoid over a...
International audienceIn 1969, Tarski asked whether the arithmetic identities taught in high school ...
AbstractIn a paper published in J. ACM in 1990, Tobias Nipkow asserted that the problem of deciding ...
A finite algebra of finite type (i.e. in a finite language) is finitely based iff the variety it gen...
A finite algebra of finite type (i.e. in a finite language) is finitely based iff the variety it gen...
Original article can be found at : http://www.sciencedirect.com/ Copyright Elsevier [Full text of th...
In this report we present some results on decidability, undecidability, semi-decidability, and non-s...