Liste des Groupes | Revenir à s logic |
On 2024-08-16 14:14:25 +0000, olcott said:When a language is insufficiently expressive to say
On 8/16/2024 8:44 AM, Mikko wrote:Who said I cannot prove or refute that? But I needn't.On 2024-08-16 12:11:19 +0000, olcott said:>
>>>
Whenever there is no sequence of truth preserving from
x or ~x to its meaning in L of F then x has no truth-maker
in F and x not a truth-bearer in F. We never get to x is
undecidable in F.
If x is not a truh-bearer it is undecidable. If x is not undecidable
the it is decidable, i.e., either x or its negation is provable.
You have the notion, you only used another vernacuar term.
>
If you cannot prove or refute that you are going to
the store to buy a carton of milk in Boolean algebra
that does not mean that Boolean algebra is incomplete.
It means that this proof is not in the domain of
Boolean algebra.
Someone may ask whether or when I am going to buy but
in that case an answer may suffice or perhaps the milk
is required but no proof.
Les messages affichés proviennent d'usenet.