The drastic product *D is known to be the smallest t-norm, since x *D y = 0 whenever x, y < 1. This t-norm is not left-continuous, and hence it does not admit a residuum. So, there are no drastic product t-norm based many-valued logics, in the sense of [7]. However, if we renounce standard completeness, we can study the logic whose semantics is provided by those MTL chains whose monoidal operation is the drastic product. This logic is called S3MTL in [17]. In this note we justify the study of this logic, which we rechristen DP (for drastic product), by means of some interesting properties relating DP and its algebraic semantics to a weakened law of excluded middle, to the Δ projection operator and to discriminator varieties. We shall show that the category of finite DP-algebras is dually equivalent to a category whose objects are multisets of finite chains. This duality allows us to classify all axiomatic extensions of DP, and to compute the free finitely generated DP-algebras. © Springer International Publishing Switzerland 2014.
CITATION STYLE
Aguzzoli, S., Bianchi, M., & Valota, D. (2014). A Note on Drastic Product Logic. In Communications in Computer and Information Science (Vol. 443 CCIS, pp. 365–374). Springer Verlag. https://doi.org/10.1007/978-3-319-08855-6_37
Mendeley helps you to discover research relevant for your work.