All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Goedel Proof, Information Transfer and Thermodynamics

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F15%3A43900692" target="_blank" >RIV/60461373:22340/15:43900692 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Goedel Proof, Information Transfer and Thermodynamics

  • Original language description

    The formula of an arithmetic theory based on Peano Arithmetics is a chain of symbols of its meta-language in which the theory is formulated such that it is both in convenience with the syntax of the meta-language and with the inferential rules of the theory. Syntactic rules constructing formulae of the theory (but not only !) are not its inferential rules. Although the meta-language syntax is defined recursively - by the recursive writing of mathematical-logical claims, only those recursively written meta-language&apos;s chains which formulate mathematical-logical claims about finite (precisely recursive) sets of individua of the theory, computable totally (thus recursive) and as always true are the formulae of the theory. Formulas of the theory are not those claims which are true as for the individua of the theory, but not inferable within the theory (Great Fermat&apos;s Theorem). They are provable but within another theory (with further axioms than only those of Peano). Also the chains expressing methodological claims, even being written recursively (Goedel Undecidable Formula) are not parts of the theory and also they are not of the inferential system; the same is for their negations. We show the Goedel substitution function}is not the total one and thus is not recursive. It is not defined for the Goedel Undecidable Formula&apos;s construction. For this construction, the structure of which is visible clearly, we are setting the zero value. This correction is based on information, thermodynamic and computing considerations, simplifies the Goedel original proof and is valid for the consistent arithmetic theories directly.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>ost</sub> - Miscellaneous article in a specialist periodical

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IIAS-Transactions on System Research and Cybernetics

  • ISSN

    1609-8625

  • e-ISSN

  • Volume of the periodical

    1

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    CA - CANADA

  • Number of pages

    11

  • Pages from-to

    48-58

  • UT code for WoS article

  • EID of the result in the Scopus database