The operation of base contraction was characterized using remainder sets for several logics. The case of {\L}ukasiewicz logics with truth-constants requires to switch from remainders to maximal consistent subsets. We characterize first contraction operators that establish a security-threshold, and use these to define optimal operators, which are provably sound w.r.t. axioms. Finally, these are shown to collapse to the former case for any finite base.
Links:
[1] http://www.iiia.csic.es/en/individual/pere-pardo
[2] http://www.iiia.csic.es/en/individual/pilar-dellunde
[3] http://www.iiia.csic.es/en/individual/lluis-godo
[4] http://www.iiia.csic.es/en/publications/keyword/Base Contraction
[5] http://www.iiia.csic.es/en/publications/keyword/T-norm fuzzy logic
[6] http://www.iiia.csic.es/en/publications/keyword/Partial meet
[7] http://www.iiia.csic.es/en/publications/export/tagged/3565
[8] http://www.iiia.csic.es/en/publications/export/xml/3565
[9] http://www.iiia.csic.es/en/publications/export/bib/3565
[10] http://www.iiia.csic.es/en/project/at
[11] http://www.iiia.csic.es/en/project/locomotion-0