A temporal semantics for Nilpotent Minimum logic

From Mathfuzzlog
Jump to: navigation, search
Authors:
Matteo Bianchi
Title: A temporal semantics for Nilpotent Minimum logic
Journal: International Journal of Approximate Reasoning
Volume 55
Number 1, Part 4
Pages: 391–401
Year: 2014
Download from the publisher





Abstract

In [6] a connection among rough sets (in particular, pre-rough algebras) and three-valued Łukasiewicz logic ŁFailed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/v1/":): {\displaystyle _3} is pointed out. In this paper we present a temporal like semantics for Nilpotent Minimum logic NM [22] and [17], in which the logic of every instant is given by ŁFailed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/v1/":): {\displaystyle _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].