Large-size message construction for ETI validation of Lingua Cosmica

The paper addresses the validation issue for the Lingua Cosmica system: have the results of sequences of reasoning (i.e. conclusions) a universal validity in some sense? LINCOS verifications of a selected set of representative statements are considered. They are compared with proofs of the same statements obtained by means of an existing proof system in computer science. The treatment indicates how formalised descriptive logic reasoning can be transposed from one system to the other. As this kind of reasoning is not bound to a specific system, it possesses an aspect of unversality.