Re: William T. Parry gets rid of Disjunction introduction
olcott <[email protected]>
| Newsgroups | sci.logic,comp.theory,comp.ai.philosophy,sci.math |
|---|---|
| Organization | A noiseless patient Spider |
| Message-ID | <[email protected]> |
On 7/6/2026 9:41 PM, André G. Isaak wrote: > On 2026-07-06 20:24, olcott wrote: > >> ∀x(φ(x) ∧ ¬φ(x)) ⊢ ⊥ >> and >> Γ ⊢ ⊥ >> -------------------- >> derivation terminated > > That's simply gibberish. > > André > How do you think that: From a contradiction nothing follows should be encoded? -- 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).