Logical Structures for Representation of Knowledge and Uncertainty

To answer questions concerning previously supplied informat- ion the book uses a truth table or 'chain set' logic which combines probabilities with truth values (possibilities). Answers to questions can be 1 (yes); 0 (no); m (a fraction in the case of uncertain information); 0m, m1 or 0m1 (in the case of 'ignorance' or insufficient information). An IF THEN statement is interpreted as specifying a conditional probab- ility value. No predicate calculus is needed in this probab- ility logic which is built on top of a yes-no logic. Quanti- fication sentences are represented as IF THEN sentences with variables. Strange results of first order logic are more reasonable in the chain set logic. E.g., (p-q)-(p-NOTq), (p-q) AND (p-NOTq), (p-q)- NOT(p-q), p-NOT p, are contradictory statements only in the chain set logic.

It is the business of science not to create laws, but to discover them. We do not originate the constitution of our own minds, greatly as it may be in our power to modify their character. And as the laws of the human intellect do not depend upon our will, so the forms of science, of (1. 1) which they constitute the basis, are in all essential regards independent of individual choice. George Boole [10, p. llJ 1. 1 Comparison with Traditional Logic The logic of this book is a probability logic built on top of a yes-no or 2-valued logic. It is divided into two parts, part I: BP Logic, and part II: M Logic. 'BP' stands for 'Bayes Postulate'. This postulate says that in the absence of knowl edge concerning a probability distribution over a universe or space one should assume 1 a uniform distribution. 2 The M logic of part II does not make use of Bayes postulate or of any other postulates or axioms. It relies exclusively on purely deductive reasoning following from the definition of probabilities. The M logic goes an important step further than the BP logic in that it can distinguish between certain types of information supply sentences which have the same representation in the BP logic as well as in traditional first order logic, although they clearly have different meanings (see example 6. 1. 2; also comments to the Paris-Rome problem of eqs. (1. 8), (1. 9) below).

Describes a new truth table logic with built-in probabilities Includes exercises and solutions to difficult exercises

Inhalt
BP Logic.- Chain Set and Probability Overview.- BP Chain Sets I, Affirmation, Negation, Conjunction, Disjunction.- BP Chain Sets II, Special Cases of Chain Sets.- BP Chain Sets III, Precise Formulations.- Inferences or the Answering of Questions.- Inferences with Higher Level Chain Sets.- IF THEN Information.- Various IF THEN Topics.- M Logic.- The M-Notation and Ignorance vs Uncertainty.- Two Types of Updating of Probabilities.- Operations and Ignorance in the M Logic.- Modus Ponens and Existence Updating.- IF THEN Information in the M Logic.- Existence Structures.- Existence Inferences.- Conditional and Joint Existence Information and Inferences.- Attributes and The Alex System versus Chain Sets.- Attributes and the Alex System versus Chain Sets.- Solutions to Some Exercises.