Let *F* be some property had by and only by the sequence of symbols:

- The sequence of symbols with property
*F*is not a sentence expressing a truth, and 2+2=4.

- The sequence of symbols with property
*F*is not a sentence expressing a truth.

- 2+2=4.

In my previous post, I tried to create space for the idea that in natural language not every pair of sentences can be conjoined. The above argument extends this to sufficiently rich artificial languages, since the above case could be formulated in an artificial language.

We can keep classical logic rules such as:

- If
*c*is the conjunction of*a*and*b*, and*a*and*b*are both true, then*c*is true,

*a*and

*b*that have no genuine conjunction. They may have a syntactic conjunction—a sequence of symbols formed out of the symbols in

*a*and

*b*and the conjunction symbol—but the preceding post shows that a syntactic conjunction is not the same as a conjunction simpliciter. And (4) must be understood in terms of genuine conjunction, not merely syntactic conjunction. This modification of classical logic does, of course, screw up the meta-theory. It doesn't affect soundness results, but completeness results may be in trouble.

## 4 comments:

This argument works even if we'd rather say "some propositions have no truth value" than "propositions have truth values essentially and sentences with no truth values are nonsense." For we can modify the first steps of the argument to

"Then, (1) [expresses a proposition which] has no truth value. For if it did..."

Strawson's view of "meaningful" was something like "having the capacity to have a truth value" and he assumed that this capacity was not always exercised. I sometimes think this would not be a bad way to go.

That might work, but I at least want to keep this claim:

If (1) expresses a proposition, the proposition it expresses is a conjunction of (2) and (3).

Hmm. Curious. The propositions expressed by (2) and (3) can still be conjoined--just write (2) in French or write (3) with Roman numerals. What apparently won't work is mechanically conjoining the *strings of symbols* in (2) and (3) and expecting the conjunction-string to express in English a proposition. This makes some sense, since property F was defined as a property of a string of symbols. But if there can be such a property F, it would seem to play havoc with the principle that exactly translated sentences express the same propositions.

Yes, that's interesting.

One can get around this by making F be a property that a sequence of symbols has if and only if it expresses the conjunction of the two conjuncts of (1). But that's tricky--expresses *in what language*?

Post a Comment