Dec-03-2018, 12:48 AM
I see what you're saying. When you're trying to determine if a sentence is logically possible you have to have a database of the definition of each word. The definitions cannot be written in natural language but must be written in a language which is easy for a computer to process. So suppose the sentence you want to analyze for consistency is: 'x is a hill and y is a mountain and x is larger than y,' which is logically impossible. Your definition for 'x is larger than y' would be written in a fashion similar to:
p ⊳ q ⊗ r
But ⊳ and ⊗ cannot be used to calculate contradiction so you have to convert that definition into:
p → (q & r)
or something similar to that. I realize that that probably doesn't illuminate things but calculating contradiction on natural language sentences takes a lot of background knowledge.
p ⊳ q ⊗ r
But ⊳ and ⊗ cannot be used to calculate contradiction so you have to convert that definition into:
p → (q & r)
or something similar to that. I realize that that probably doesn't illuminate things but calculating contradiction on natural language sentences takes a lot of background knowledge.