BP Chain Sets I, Affirmation, Negation, Conjunction, Disjunction
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.
KeywordsPropositional Calculus Single Chain Composite Component Atomic Component Partition Theorem
Unable to display preview. Download preview PDF.