BP Chain Sets I, Affirmation, Negation, Conjunction, Disjunction

  • Ellen Hisdal née Gruenwald
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 14)


In this chapter we present the construction of chain sets representing information in the form of noncomposite or composite sentences or labels λ with affirmations, negations and AND and OR connectives. Chain sets representing IF THEN information are discussed in chapters 8, 9 and 14. The procedures for answering questions in the form of such noncomposite or composite sentences, including IF THEN questions, are given in chapter 6. They are valid for both the BP logic of part I, and the M logic of part II.


Propositional Calculus Single Chain Composite Component Atomic Component Partition Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ellen Hisdal née Gruenwald
    • 1
  1. 1.Department of InformaticsUniversity of OsloOsloNorway

Personalised recommendations