A temporal semantics for Nilpotent Minimum logic

Abstract

In [Ban97] 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 ([Fod95, EG01]), 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 [AGM08] and [ABM09], in which the authors construct a temporal semantics for the many-valued logics of G\"odel ([G\"od32], [Dum59]) and Basic Logic ([H\'aj98]).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…