Skip to main content
Springer Nature Link
Log in

Nonboolean partitions and their logic

  • Original paper
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Milan, Via Comelico 39-41, 20135 Milan, Italy e-mail: mundici@imiucca.csi.unimi.it, , , , , , IT

    D. Mundici

Authors
  1. D. Mundici
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s005000050029