As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Nevertheless, in the general case, this notion is inadequate for revision, where it is replaced by maximal consistent subsets. A natural question is whether this latter notion allows for a definition of contraction-like operators and, in case it does, what differences there exist w.r.t. standard contraction. We make some steps towards this direction for the case of graded expansions of one of the most prominent fuzzy logics, Łukasiewicz logic. We characterize contraction operators with a fixed security-threshold ε>0; we prove soundness of (an optimal) ω-contraction operation, and a collapse theorem from ω- to some ε-contraction for finite theories.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.