Abstract
Working in the framework of the infinite-valued propositional calculus of Łukasiewicz we develop a generalization of the notion of boolean partition. Applications are given to handle the dependent and the independent variable in approximate definitions by cases—as softly, tractably and robustly as possible.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mundici, D. Nonboolean partitions and their logic. Soft Computing 2, 18–22 (1998). https://doi.org/10.1007/s005000050029
Issue Date:
DOI: https://doi.org/10.1007/s005000050029