A circuit-based proof of Toda's theorem

As it was shown in Jenei and Montagna (Studia Logica 70(2): 183---192, 2002), Monoidal t-norm based logic (MTL) is a logic of left-continuous t-norms. In other words, this means that MTL enjoys the standard completeness theorem. In this paper we present ...

For finite automata as coalgebras in a category C, we study languages they accept and varieties of such languages. This generalizes Eilenberg’s concept of a variety of languages, which corresponds to choosing as C the category of Boolean algebras. ...

We construct the universal enveloping algebra of a Leibniz n-algebra and we prove that the category of modules over this algebra is equivalent to the category of representations. We also give a proof of the Poincare-Birkhoff-Witt theorem for universal ...