Thursday, September 02, 2004

The verification principle is too narrow...

In its simplest form, the principle goes like this : The meaning of a proposition is its method of verification, with the important corollary that a proposition without a method of verification is meaningless. This is one of the basic tenets of Logical Positivism and, most famously, the one marshalled into the service of the movements goal to eliminate metaphysics (metaphysical statements, having no method of verification, are meaningless).

One of the most common technical attack against Logical Positivism is to show that this principle is too narrow, i.e. that it eliminates as meaningless a number of sentences that the Logical Positivists would admit themselves to being meaningful. One such sentence is 'all men are mortal' and in fact, many other statements with an universal quantifier ranging over a potentially infinite set of natural objects, could be used to the same effect. The other name of Logical Positivism, and in fact, the one prefered by its members, is Logical Empiricism. So in all cases, what is meant by 'method of verification' is 'empirical method of verification'. That is to say a procedure, or series of steps, that can actually be performed by an individual or group of individuals in a real situation. One of the consquence of this is that the procedure in question must involve no more than a finite number of steps. But how are you going to check that all men are mortal in a finite number of steps ? Should we declare this statement meaningless and, with it, all the familiar ones like 'All C14 nuclei will eventually disintegrate' ?

In the same vein, but even more crucially to science, are statements like 'the laws of nature do not vary arbitrarily'. How is anyone going to engage in doing Physics if he does not believe that the laws of nature are stable over time ? So, presumably, all physicists believe in the statement above. And 'believing in' is even stronger than , and thus entails, 'considering meaningful'. But how are you going to check in a finite number of steps that the laws of nature, or even a single one, is stable over time ?

A last example, from computability theory, that is to say, from logic itself. The statement 'the Turing Machine M terminates' is presumably meaningful: it derives from the very definition of the mathematical object 'Turing Machine'. But it is provably impossible to verify it in a finite number of steps as established by the 'undecidability of the halting problem' theorem.

So, after examination, the verification principle, which was meant as a very precise and clear-cut discrimination tool, seems to be doing a lot of damage in the Logical Positivists own foot soldiery's ranks : the scientists. A case of 'friendly fire', or so it seems.

3 Comments:

At September 2, 2004 at 8:02 PM, Blogger Doctor Logic said...

You have chosen some interesting examples of propositions that we naively accept, but which cannot be verified.

I'll discuss them in reverse order.

'the laws of nature do not vary arbitrarily'This is really a heuristic statement. You are correct that we scientists cannot live without this assumption. However, this is really an assumption that goes into every scientific model, and not a proposition in and of itself. It's as if all physical laws are prefixed with assuming the laws of nature are fixed, then...

We assume that the universe is governed by physical laws because, if it were not, then science would not be a useful endeavor. We do not need to assert that the universe is governed by physical laws independently of complete scientific propositions. Indeed, we might accept a priori that physical laws might not be fixed and that we can predict nothing (ever). However, this is not a productive line of reasoning, since no propositions about the world will ever forecast an observation (even if the proposition were correct).

'all men are mortal'Here, I think that the Logical Positivists are basically correct. Does the statement mean all men ever? What is the definition of mortal? This proposition is vague even in common-sense English.

I still hold that meaningful propositions about experience must be empirically testable with a finite number of trials.

'All C14 nuclei will eventually disintegrate'This is also not a strictly meaningful expression of a natural law. It would be more accurate to say that:

'A given C14 nucleus will have a mean lifetime of 8000 years, and, after 8000 years, if the nucleus has not decayed, its mean lifetime will still be 8000 years.'

This is a model of C14 which is testable. Technically, there is no requirement that a C14 nucleus ever decay.

On a larger scale, the physical laws governing decays by the weak interactions lead to a statistical distribution of lifetime for nuclei, e.g.,

Half-life of C14 = 5730 years.
As a function of Time,
Quantity of C14 = Initial Quantity / exp(c * Time)
where c = ln (0.5) / 5730 years

The statistical distribution gives an expected quantity of zero given a sufficiently large period of time, but it is only a distribution.

The reason we permit the "meaningless" propositions to go unchallenged is because our brains reformulate the propositions subconsciously.

'the Turing Machine M halts'I am not an expert on computing theory, but I took this opportunity to read about the halting problem on Wikipedia.

http://en.wikipedia.org/wiki/Halting_problem

I learned that the halting problem is related to the weak version of the Godel Incompleteness theorem. The article also includes the following quote:

...one might say that the halting theorem itself is unsurprising. If there were a mechanical way to decide whether arbitrary programs would halt, then many apparently difficult mathematical problems would succumb to it. It would be very surprising to learn that so many problems which had puzzled mathematicians for so long all turned out to be so easily solved.In this sense, the halting problem is really a Trojan Horse for a very wide range of mathematical propositions, some of which have challenged mathematicians for centuries.

Like Godel's Incompleteness Theorem, the Halting Problem is a proposition about all propositions. It's a like the Librarian Problem in computer terms. As such, we have mathematical proof that the proposition is meaningless.

The foregoing does not invalidate individual propositions such as:

'specific Turing Machine X halts within N steps'

doctor(logic)

 
At September 3, 2004 at 7:59 AM, Blogger Doctor Logic said...

Hi Nicolas,

I just wanted to clarify a couple of my comments from last night.

I wrote:

"Technically, there is no requirement that a C14 nucleus ever decay."and this should instead read :

"Technically, there is no requirement that an individual C14 nucleus ever decay."I also wrote:

"It's a like the Librarian Problem in computer terms. As such, we have mathematical proof that the proposition is meaningless."which could be phrased more clearly as:

"It's a like the Librarian Paradox in computer terms. As such, we have mathematical proof (Godel's Theorem) that the proposition is meaningless."doctor(logic)

 
At April 8, 2016 at 10:15 PM, Anonymous Anonymous said...

moncler, barbour jackets, ugg boots uk, moncler, canada goose, moncler, bottes ugg, wedding dresses, vans, canada goose uk, canada goose, converse outlet, replica watches, ray ban, pandora jewelry, moncler, thomas sabo, marc jacobs, canada goose outlet, barbour, pandora jewelry, louis vuitton, sac louis vuitton pas cher, moncler, canada goose, links of london, moncler outlet, moncler, converse, lancel, ugg,ugg australia,ugg italia, toms shoes, montre pas cher, ugg pas cher, canada goose outlet, karen millen, pandora charms, hollister, pandora charms, juicy couture outlet, canada goose, coach outlet, swarovski crystal, swarovski, gucci, louis vuitton, louis vuitton, moncler, supra shoes, ugg,uggs,uggs canada, doudoune canada goose, louis vuitton, juicy couture outlet
ninest123 16.04

 

Post a Comment

<< Home