Gödelization

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorZeleny, Enrique
dc.date2016-10-26T17:47:40Z
dc.date2016-10-26T17:47:40Z
dc.date.accessioned2017-04-06T11:36:34Z
dc.date.available2017-04-06T11:36:34Z
dc.identifierhttp://acervodigital.unesp.br/handle/unesp/360662
dc.identifierhttp://objetoseducacionais2.mec.gov.br/handle/mec/5261
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/956944
dc.descriptionMathematical Logic
dc.descriptionIn 1931 Kurt Gödel established a representation between a formal system and the set of natural numbers to prove his famous incompleteness theorem. An axiom or a proof is encoded by assigning to each symbol in the expression odd numbers as the powers of successive primes. The expression can be recovered by factoring the number
dc.descriptionComponente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.relation75Goedelization.nbp
dc.rightsDemonstration freeware using Mathematica Player
dc.subjectMathematical logic
dc.subjectComputer systems
dc.subjectDiscrete mathematics
dc.subjectLógica matemática
dc.subjectEducação Superior::Ciências Exatas e da Terra::Matemática::Análise Numérica
dc.titleGödelization
dc.typeOtro


Este ítem pertenece a la siguiente institución