A temporal semantics for Nilpotent Minimum logic

Citations of this article
Mendeley users who have this article in their library.


In [6] a connection among rough sets (in particular, pre-rough algebras) and three-valued Łukasiewicz logic Ł3 is pointed out. In this paper we present a temporal like semantics for Nilpotent Minimum logic NM [22,17], in which the logic of every instant is given by Ł 3: a completeness theorem will be shown. This is the prosecution of the work initiated in [5] and [1], in which the authors construct a temporal semantics for the many-valued logics of Gödel [24,14] and Basic Logic [27]. © 2013 Elsevier Inc. All rights reserved.




Bianchi, M. (2014). A temporal semantics for Nilpotent Minimum logic. International Journal of Approximate Reasoning, 55(1 PART 4), 391–401. https://doi.org/10.1016/j.ijar.2013.10.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free