Strong Negation: Its Relation to Intervals and its Use in Expert Systems
Scott A. Starks, Владик Крейнович, Hung Tan Nguyen, Hoang Phuong Nguyen, Mirko Navara · scholarworks - UTEP (The University of Texas at El Paso) · 1998
out the real world. In more precise terms, we are interested in knowing whether S follows from a statement (or statements) T that describe these assumptions. In other words, this "follows from" relation is one of the basic relations in every logic. Intuitively, each statement follows from itself, and if A follows from B, and B follows from C, then A follows from C. Hence, "follows from" is a reflexive and transitive relation, i.e., in mathematical terms, a pre-ordering. In the following text, we will denote this relation by . How can we prove that A follows from B, i.e., that A B? Due to transitivity, if we cannot prove this implication directly, we can try to do it in two steps: namely, we can try to find some intermediate statement C for