Liste des Groupes | Revenir à s logic |
On 7/6/2024 6:28 PM, Richard Damon wrote:And if x is defined in L as ~True(L,x) means that True(L, x) is false, then x being the negation of that result is a true statement.On 7/6/24 6:41 PM, olcott wrote:True(L,x) means x is true.On 7/6/2024 5:22 PM, Richard Damon wrote:>On 7/6/24 6:08 PM, olcott wrote:>On 7/6/2024 4:02 PM, Richard Damon wrote:>The problem here is you logic doesn't actually allow for the necessaery references in it.Not at all. My logic is simply smart enough to reject
>
non-truth-bearers AKA expressions that are not valid
propositions. It does not stupidly falsely assume that
every expression is a valid proposition.\
Logic isn't "Smart", it follows its rules.
>
Your rules are just inconsistent.
>
When-so-ever true means provable and false means not provable
the meaning of these words proves that such a system cannot
get stuck in pathological expressions.
And such a definition requires the system to be keep simple or it becomes inconsistant.
>>>
LP := ~True(LP) has a cycle in the directed
graph of the elements of the expression related
to each other that Prolog and MTT detects.
>
So, what value does True(LP) return?
>
~True(L,x) means x is untrue which includes false and not a proposition.
True(L,~x) means x is false.
~True(L,~x) means x is unfalse which includes true and not a proposition.
True(L,LP) is false and True(L,~LP) is false which means LP
is not a proposition.
If it returns your error below, it fails to meet the requirements, as "nonsense" statement must return false.
>
But then, not that false is true, so the predicate is in its problem.
>
THe only answers are:
1) Not have a True Predicate.
2) Not allow that form of reference, even indirectly, which limits the power of the logic system.
>?- LP = not(true(LP)).>
LP = not(true(LP)).
?- unify_with_occurs_check(LP, not(true(LP))).
false.
>
>
Les messages affichés proviennent d'usenet.