1
Classes and Sets
1 BUILDING SENTENCES
Before introducing the basic notions of set theory, it will be useful to make certain observations on the use of language.
By a sentence we will mean a statement which, in a given context, is unambiguously either true or false. Thus
London is the capital of England.
Money grows on trees.
Snow is black.
are examples of sentences. We will use letters P, Q, R, S, etc., to denote sentences; used in this sense, P, for instance, is to be understood as asserting that āP is true.ā
Sentences may be combined in various ways to form more complicated sentences. Often, the truth or falsity of the compound sentence is completely determined by the truth or falsity of its component parts. Thus, if P is a sentence, one of the simplest sentences we may form from P is the negation of P, denoted by Ā¬P (to be read ānot P ā), which is understood to assert that āP is false.ā Now if P is true, then, quite clearly, Ā¬P is false; and if P is false, then Ā¬P is true. It is convenient to display the relationship between Ā¬P and P in the following truth table,
where t and f denote the ātruth valuesā, true and false.
Another simple operation on sentences is conjunction: if P and Q are sentences, the conjunction of P and Q, denoted by P ā§ Q (to be read āP and Qā), is understood to assert that āP is true and Q is true.ā It is intuitively clear that P ā§ Q is true if P and Q are both true, and false otherwise; thus, we have the following truth table.
The disjunction of P and Q, denoted by P āØ Q (to be read āP or Qā), is the sentence which asserts that āP is true, or Q is true, or P and Q are both true.ā It is clear that P āØ Q is false only if P and Q are both false.
An especially important operation on sentences is implication : if P and Q are sentences, then P ā Q (to be read āP implies Qā) asserts that āif P is true, then Q is true.ā A word of caution: in ordinary usage, āif P is true, then Q is trueā is understood to mean that there is a causal relationship between P and Q (as in āif John passes the course, then John can graduateā). In mathematics, however, implication is always understood in the formal sense: P ā Q is true except if P is true and Q is false. In other words, P ā Q is defined by ...