The theory of implication relations
Arnold Koslow · Cambridge University Press eBooks · 1992
Conditions on implication In Part I we outlined a program for the logical operators that has two components, one consisting of implication relations, the other consisting of characterizations of the logical operators relative to these implication relations. If we think of an implication structure I = 〈 S , ⇒〉 as a nonempty set S together with an implication relation “⇒” on it, then the logical operators are functions that on each implication structure assign (sets of) elements of it that count as hypothetical, conjunctions, negations, disjunctions, quantifications, and so forth, of that structure. Thus, the general picture is one in which the logical operators are relativized to implication relations, and each one is specified without recourse to any of the operators to be characterized. Otherwise the program would be circular from the outset. Our present concern, then, is the study of implication structures, nonempty sets with implication relations on them. We have described implication relations (on a set S ) as any finitary relation on S (which we write with a double arrow) that satisfies the six conditions specified in Chapter 1. Any relation will count for us as an implication relation if it satisfies these conditions. Some of these conditions follow from the others, but we shall retain the less elegant formulation for the sake of greater perspicuity.