Phi 270 Fall 2013 |
|
(Site navigation is not working.) |
2.1.1. A connective
We are interested in logical forms as a way of stating general laws of entailment. Let us begin by looking at cases of entailment that seem to involve the word and. Here is an example:
In attempting to understand any fact, it is useful to collect related facts. One way to search for related facts about entailment is to look for cases involving sentences similar in grammatical form to those above. If we follow this route, we run into entailments like this:
And we will eventually hit upon a general pattern like this:
Although we will soon move on to more general patterns than this, any pattern that abstracts from particular words makes the label formal logic
appropriate.
If we look a little farther afield in our search for related facts, we also find examples like
which follows the pattern
This pattern can be seen to operate also in examples of the first group if we paraphrase them, transforming
for instance, into
When we apply a pattern by first paraphrasing, as we have done here, we treat a sentence as having a form that is hidden by its surface appearance. Much of our analysis of logical form will involve this sort of transition.
Both of the patterns above give us general laws of inference. But, in the second more general pattern, it is especially clear that the word and plays a key role. If we look at what this role involves, we see that and marks a particular sort of compound sentence formed of component sentences, one that we will label a conjunction. So the word and is a sign for an operator that forms conjunctions. We will call an operator that forms compound sentences out of component sentences a connective, and we will refer to the connective we are considering here as conjunction, marking it with the sign ∧ (one of whose names is logical and). (The use of the term conjunction for both the operation of conjoining, the operator that performs this operation, and the compound that results from it may seem confusing, but it follows a pattern that is used fairly often in English—as when the word distribution is used both for the act of distributing and for its result.) It will often be convenient to employ a further related term and refer to the components of a conjunction as its conjuncts.
Using these ideas, we can express our analysis of That bear is large and edgy as
and we can express our principle of entailment as
This symbolic notation can save space, but it is often convenient to use English to mark conjunction. When we do this, we will use the construction both
… and
… and write it (as done here) using a special type. So the principle above could be stated as
both
φ and
ψ ⊨ φ.
(The reason for using the particle both
in addition to and
will be discussed later.)
At this point, we have reached a stage like that reached by a physicist who recognizes pressure, temperature, and volume as physical quantities and has formulated a law relating them but who does not know why the law holds. That is, we have a generalization about entailment that we can apply in special cases, but we cannot say why this generalization is true. So let’s go on to ask what it is about conjunction that makes this sort of entailment work.
We can find an answer by again scaring up some more facts. Notice, for example, that the entailment that got us started is matched by a second.
Moreover, we can see not only that the sentence That bear is large and edgy entails each of the two sentences That bear is large and That bear is edgy but also that it is entailed in turn by the two taken together.
If we abbreviate the longer sentence by B and the two shorter sentences as L and E, respectively, we have collected the following facts:
And checking other cases of conjunction would show us that these are instances of three general laws.
Or, using English to express the forms,
both
φ and
ψ ⊨ φ
both
φ and
ψ ⊨ ψ
both
φ and
ψ.
So far, all we have done is to accumulate more general laws, but sometimes a larger number of facts is easier to understand because a pattern can begin to emerge.