Papers
Topics
Authors
Recent
Search
2000 character limit reached

A temporal semantics for Nilpotent Minimum logic

Published 22 Oct 2013 in math.LO and cs.LO | (1310.5916v1)

Abstract: In [Ban97] a connection among rough sets (in particular, pre-rough algebras) and three-valued {\L}ukasiewicz logic {\L}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 {\L}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]).

Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.