Re: William T. Parry gets rid of Disjunction introduction
olcott <[email protected]>
| Newsgroups | sci.logic,comp.theory,sci.math,comp.ai.philosophy,alt.philosophy |
|---|---|
| Organization | A noiseless patient Spider |
| Message-ID | <[email protected]> |
On 7/4/2026 8:28 PM, André G. Isaak wrote: > Q is a necessary consequence of P seems best handled by https://en.wikipedia.org/wiki/Relevance_logic or Parry's Entailment Logic P □ Q 0 0 0 0 0 0 1 0 0 1 1 1 Changes the notion of valid inference too much. I myself simply leap all the way to the end and say that the full natural language semantic meaning must be encoded for both P and Q such that P ⊢ Q by semantic entailment specified syntactically. This is accomplished in a language such as CycL. https://en.wikipedia.org/wiki/CycL -- Copyright 2026 Olcott My 28 year goal has been to make "true on the basis of meaning expressed in language" reliably computable for the entire body of knowledge. The complete structure of this system is now defined. The entire body of knowledge expressed in language is comprised of two types of relations between finite strings: (a) *Axioms* Expressions of language that are stipulated to be true. My system bridges the analytic/synthetic distinction by expressly encoding all empirical "atomic facts" in a formal language such as CycL of the Cyc project. (b) *Inference Rules* Expressions of language that are semantically entailed syntactically from (a) and/or (b).