Is There a Difference Between Meaningless and Undecidable Statements?

  • Thread starter honestrosewater
  • Start date
In summary, a statement S is meaningless if its solution set is empty, and S is undecidable if its solution set contains contradictory solutions. These terms can also be applied to statements that are factually meaningless, where the truth value cannot be determined due to lack of context or impossibility of evaluation.
  • #1
honestrosewater
Gold Member
2,142
6
Are the following definitions correct?
A statement S is meaningless if its solution set is empty.
S is undecidable if its solution set contains contradictory solutions.
:confused:
I am having problems understanding those terms. If someone can give me a precise explanation, I would appreciate it.
___
Sorry, momentary lapse of judgment. This isn't really the appropriate forum.
 
Last edited:
Physics news on Phys.org
  • #2
Statements do not have solution sets.

S is undecidable in a formal system X, with axioms A(X) if both A and S, and A and notS are not inconsistent.

Examples:

the continuum hypothesis, and the axiom of choice are undecidable in ZF. (proof mainly due to Cohen.)

A statement/proposition U=>V is vacuous if U is always false, which is as close to meaningless as I can get for you I think.

I hope Hurkly can clear this up, he seems to understand this best.
 
  • #3
matt grime said:
S is undecidable in a formal system X, with axioms A(X) if both A and S, and A and notS are not inconsistent.
So if
[tex](A \wedge S) \wedge (A \wedge \neg S)[/tex]
is true, then S is said to be undecidable in X? Or if the above is "not false" or "possible"? I don't understand precisely what "not inconsistent" means.

Or is A considered to not be a statement?

Are undecidable statements only possible if A(X) does not include both the Laws of Non-Contradiction and the Excluded Middle?
I am thinking about this, but I could use a hint.
 
  • #4
I was carefully trying not to say consistent.

What it means is if I assume S is true I can contradict none of the axioms in A, and similarly if I assume S is false then I still can contradict none of the axioms in A. Or I can neither prove S is true, nor S is false from the axioms, A.


A isn't a statement, A is the collection of axioms of the underlying theory. (usually we talk of ZF).

The last thing you wrote is definitely not true. I gave you two examples of undecidable statements in ZF, where we are implicitly using predicate logic.

For instance the parallel postulate is 'independent' of the other axioms of geometry - neither it nor its negation can be deduced from the other axioms. (proof - we construct models satisfying the other axioms one of which has the parallel postulate true, the other has it false, eg the hyperbolic model and the euclidean model.)
 
  • #5
You rock. Thank you.

Some further clarifications:
The undecidability of S in X can only be determined if S is well-formed in X?

Can decidability be extended to all possible truth-values in X? That is, if T, F, and P are all possible truth-values in X, can you say:
S is undecidable in X if neither (S is T) nor (S is F) nor (S is P) can be proven from A? Or is it restricted to only true and false?
 
Last edited:
  • #6
honestrosewater said:
Are the following definitions correct?
A statement S is meaningless if its solution set is empty.
S is undecidable if its solution set contains contradictory solutions.
:confused:
I am having problems understanding those terms. If someone can give me a precise explanation, I would appreciate it.
___
Sorry, momentary lapse of judgment. This isn't really the appropriate forum.

I get the impression you were originally asking this question in an informal context. You'll need to specify what kind of "meaningless" you are referring to. A statement is said to be factually meaningless if the truth value of that statement cannot be determined in principle. Take, for instance, the statement "blok is greener than wolt." Because we don't know what the words "blok" and "wolt" refer to, there is no way to assign a truth value to this statement. Put into logical terms, this statement is not a proposition, and so no propositional calculus can be applied to any argument containing this statement. Such an argument would not be a truth-functional argument. Of course, that statement is also grammatically meaningless because it contains words that don't exist.

However, there is no need to use an example that contains made-up words. Take the statement "I am 24." This statement is also factually meaningless if taken out of context, because we do not know what the word "I" refers to. If it's referring to me, then it is true. But if you make the statement, it might not be. This statement can also not be part of a truth-functional argument, unless it is prefaced by another statement that made explicit who the word "I" is referring to. Any statement whose truth value is thus indeterminable is factually meaningless, even though clearly the latter statement has a grammatical meaning, whereas the former does not.

There is also another way in which a statement can be factually meaningless. Take the statement "Aristotle is more of a female than Socrates." Even though we know what every word refers to, and all of the words are real words, there is still no way to evaluate the truth value of this statement, simply because neither Aristotle nor Socrates is female, and neither can be more or less female than the other. You might simply contend that the statement is false, but according to the rules of logic, the negation of any false statement is true, and clearly the statement "Aristotle is less female than Socrates" is not true.

I don't know how to answer the questions you asked initially, because as Matt pointed out, statements don't have solution sets, so their solution sets can be neither empty nor can they contain contradictions.
 
  • #7
loseyourname said:
You'll need to specify what kind of "meaningless" you are referring to.
Wow, I meant to say "undefined", not meaningless. For instance, 1/0 is "undefined" in a field. (I am familiar with 1/0, but not with "undefined")
Sorry, don't ask how I made and repeatedly overlooked that mistake. Your explanations have not gone to waste, though. Thank you.

Put into logical terms, this statement is not a proposition, and so no propositional calculus can be applied to any argument containing this statement.
Can a statement be both "factually meaningless" and "undecidable"? I would assume not, but this would answer my question, "The undecidability of S in X can only be determined if S is well-formed in X?"
 
  • #8
Actually, any given statement is factually meaningless if its truth value is undecidable. There is no way for a statement itself to be undecidable. How do you decide a statement?
 
  • #9
loseyourname said:
Actually, any given statement is factually meaningless if its truth value is undecidable.
Oh, right. I was only thinking of your first example. Wow, I'm developing quite a bad track record in this thread.
There is no way for a statement itself to be undecidable.
I know, just an oversight.
 

1. What is the difference between a meaningless statement and an undecidable statement?

A meaningless statement is one that does not have a clear or logical meaning. It may be grammatically correct, but it lacks any significant meaning or purpose. On the other hand, an undecidable statement is one that may have a clear meaning, but cannot be proven to be either true or false.

2. Can a meaningless statement become meaningful?

No, a meaningless statement cannot become meaningful. It is not possible to assign meaning to something that does not have any inherent meaning or purpose. However, the context in which a statement is used can sometimes give it meaning.

3. How do you determine if a statement is meaningless or undecidable?

Determining if a statement is meaningless or undecidable can be a difficult task. In general, a meaningless statement will have no logical or semantic meaning, while an undecidable statement will have a clear meaning but cannot be proven to be true or false. It often requires careful analysis and consideration of the context in which the statement is used.

4. Can an undecidable statement ever be proven to be true or false?

No, an undecidable statement cannot be proven to be true or false. This is because it is inherently impossible to prove or disprove a statement that is undecidable. The best that can be done is to provide evidence or arguments for one side or the other, but a definitive proof is not possible.

5. Are there any practical applications for studying meaningless and undecidable statements?

Studying meaningless and undecidable statements can have practical applications in fields such as logic, mathematics, and computer science. It can help us better understand the limits of our reasoning and the nature of truth. In computer science, the study of undecidable statements is crucial for developing algorithms and solving complex problems.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
1K
  • Special and General Relativity
Replies
4
Views
2K
  • Topology and Analysis
Replies
2
Views
1K
Replies
4
Views
1K
  • Differential Geometry
Replies
9
Views
2K
  • Advanced Physics Homework Help
Replies
3
Views
2K
  • Topology and Analysis
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
17
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
911
  • Special and General Relativity
Replies
11
Views
1K
Back
Top