A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so far (apparently) unexplored journey. As a first step, we will characterise rational closure in the context of Propositional Gödel Logic. Proof. It follows the proof of the classical counterpart (, Proposition 6). It is sufficient to reformulate the set S Now we can prove the maindoi:10.1007/978-3-642-45221-5_16 fatcat:snajpj3lvjcvjdk2iokyxoyyye