Gödel algebras form the locally finite variety of Heyting algebras satisfying the prelinearity axiom Formula Not Shown . In 1969, Horn proved that a Heyting algebra is a Gödel algebra if and only if its set of prime filters partially ordered by reverse inclusion–i.e. its prime spectrum–is a forest. Our main result characterizes Gödel algebras that are free over some finite distributive lattice by an intrisic property of their spectral forest
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
We present an equivalence between the category of Nelson Paraconsistent lattices (NPc-lattices) and ...
We present an equivalence between the category of Nelson Paraconsistent lattices (NPc-lattices) and ...
We obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i.e. Heyti...
AbstractWe obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i....
There are at least two different methods for describing finitely generated free Heyting algebras. On...
In this paper we investigate those subvarieties of the variety SH of semi-Heyting algebras which are...
We study finitely generated Heyting algebras from algebraic and model theoretic points of view. We p...
AbstractWe obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i....
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
ABSTRACT. The purpose of this paper is to define and investigate a new (equational) class of algebra...
In this paper we introduce and study finite G ¿odel algebras with operators (GAOs for short) and the...
We study finitely generated free Heyting algebras from a topological and from a model theoretic poin...
AbstractIn this paper we find the number of free generating sets with q elements for free algebras i...
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
We present an equivalence between the category of Nelson Paraconsistent lattices (NPc-lattices) and ...
We present an equivalence between the category of Nelson Paraconsistent lattices (NPc-lattices) and ...
We obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i.e. Heyti...
AbstractWe obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i....
There are at least two different methods for describing finitely generated free Heyting algebras. On...
In this paper we investigate those subvarieties of the variety SH of semi-Heyting algebras which are...
We study finitely generated Heyting algebras from algebraic and model theoretic points of view. We p...
AbstractWe obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i....
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
ABSTRACT. The purpose of this paper is to define and investigate a new (equational) class of algebra...
In this paper we introduce and study finite G ¿odel algebras with operators (GAOs for short) and the...
We study finitely generated free Heyting algebras from a topological and from a model theoretic poin...
AbstractIn this paper we find the number of free generating sets with q elements for free algebras i...
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
We present an equivalence between the category of Nelson Paraconsistent lattices (NPc-lattices) and ...
We present an equivalence between the category of Nelson Paraconsistent lattices (NPc-lattices) and ...
DOI
Add to ORKG