Gödelization

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.creator	Zeleny, Enrique
dc.date	2011-05-26T19:49:16Z
dc.date	2011-05-26T19:49:16Z
dc.date	2011-05-26
dc.date.accessioned	2017-04-05T16:49:33Z
dc.date.available	2017-04-05T16:49:33Z
dc.identifier	http://acervodigital.unesp.br/handle/123456789/2903
dc.identifier	http://objetoseducacionais2.mec.gov.br/handle/mec/5261
dc.identifier.uri	http://repositorioslatinoamericanos.uchile.cl/handle/2250/830314
dc.description	Mathematical Logic
dc.description	In 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.description	Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.relation	75Goedelization.nbp
dc.rights	Demonstration freeware using Mathematica Player
dc.subject	Mathematical logic
dc.subject	Computer systems
dc.subject	Discrete mathematics
dc.subject	Lógica matemática
dc.subject	Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Numérica
dc.title	Gödelization
dc.type	Software