Add to ORKGsummary:It is shown how Lawvere's one-to-one translation between Birkhoff's description of varieties and the categorical one (see [6]) turns Hu's theorem on varieties generated by a primal algebra (see [4], [5]) into a simple reformulation of the classical representation theorem of finite Boolean algebras as powerset algebras
This thesis consists of two independent chapters. The first chapter deals with universal algebra. It...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
On a very natural image of sets, every set has an absolute complement. The ordinary cumulative hier...
summary:It is shown how Lawvere's one-to-one translation between Birkhoff's description of varieties...
It is shown how Lawvere’s one-to-one translation between Birkhoff’s description of varieties and the...
peer reviewedWe study varieties generated by semi-primal lattice-expansions by means of category the...
We study varieties generated by semi-primal lattice-expansions by means of category theory. We provi...
We study many-valued coalgebraic logics with primal algebras of truth-degrees. We describe a way to ...
AbstractTwo algebraic structures A and B are called categorically equivalent if there is a functor f...
We prove the following completeness result about classical realizability: given any Boolean algebra ...
A finite algebra is called automorphism-primal if its clone of term operations coincides with all op...
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite p...
summary:J. Płonka in [12] noted that one could expect that the regularization ${\mathcal R}(K)$ of...
We study computably enumerable boolean algebras, focusing on Stone duality and universality phenomen...
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that i...
This thesis consists of two independent chapters. The first chapter deals with universal algebra. It...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
On a very natural image of sets, every set has an absolute complement. The ordinary cumulative hier...
summary:It is shown how Lawvere's one-to-one translation between Birkhoff's description of varieties...
It is shown how Lawvere’s one-to-one translation between Birkhoff’s description of varieties and the...
peer reviewedWe study varieties generated by semi-primal lattice-expansions by means of category the...
We study varieties generated by semi-primal lattice-expansions by means of category theory. We provi...
We study many-valued coalgebraic logics with primal algebras of truth-degrees. We describe a way to ...
AbstractTwo algebraic structures A and B are called categorically equivalent if there is a functor f...
We prove the following completeness result about classical realizability: given any Boolean algebra ...
A finite algebra is called automorphism-primal if its clone of term operations coincides with all op...
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite p...
summary:J. Płonka in [12] noted that one could expect that the regularization ${\mathcal R}(K)$ of...
We study computably enumerable boolean algebras, focusing on Stone duality and universality phenomen...
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that i...
This thesis consists of two independent chapters. The first chapter deals with universal algebra. It...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
On a very natural image of sets, every set has an absolute complement. The ordinary cumulative hier...