Theorem

  • Uploaded by: Francisco Antonio Ceron Garcia
  • 0
  • 0
  • June 2020
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View Theorem as PDF for free.

More details

  • Words: 351
  • Pages: 2
Theorem: From Logic to Ontology: The limit of “The Semantic Web”. Francisco Antonio Cerón García Physic's Spanish Royal Society [email protected]

The limit of the Semantic Web is not set by the use of machines themselves, and biological systems could be used to reach this goal, but as the Logic that is being used to construct it does not contemplate the concept of time, since it is purely formal logic and metonymic lacks the metaphor, and this is what Gödel’s theorems remark, the final tautology of each construction or metonymic Mathematical Language , which leads to inconsistencies. The construction of the Semantic Web is an Undecidible Problem . This consistent logic is completely opposite to the logic that makes inconsistent use of time, inherent in human unconscious, but the use of time is built on the lack, not on positive things, it is based on denials and absences, and this is impossible to reflect on a machine because of the perceived lack of the required self-awareness is acquired with the absence. The problem is we are trying to build an intelligent system to replace our way of thinking, at least in the information search, but the special nature of human mind is the use of time which lets human beings reach a conclusion, therefore does not exist in the human mind the Halting Problem or stop of calculation.

So all efforts faced toward semantic web are doomed to failure a priori if the aim is to extend our human way of thinking into machines, they lack the metaphorical speech, because only a mathematical construction, which will always be tautological and metonymic, and lacks the use of the time that is what leads to the conclusion or “stop”. As a demonstration of that, if you suppose it is possible to construct the semantic web, as a language with capabilities similar to human language, which has the use of time, should we face it as a theorem, we can prove it to be false with a Counter Example, and it is given in the particular case of the Turing machine and “the halting problem”.

Related Documents

Theorem
June 2020 31
Theorem
June 2020 17
Bayes Theorem
October 2019 38
Salary Theorem
April 2020 10
Congruence Theorem
December 2019 20
Master Theorem
April 2020 8

More Documents from "madhuyadav"