You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360662
Title: 
Gödelization
Author(s): 
Zeleny, Enrique
Language: 
eng
Description: 
  • Mathematical Logic
  • 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
  • Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
Issue Date: 
  • 11-Sep-2008
  • 11-Sep-2008
  • 2008
  • 11-Sep-2008
  • 9-Sep-2008
Keywords: 
  • Mathematical logic
  • Computer systems
  • Discrete mathematics
  • Lógica matemática
  • Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Numérica
Notes: 
Show the Gödelization
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5261
URI: 
http://acervodigital.unesp.br/handle/unesp/360662
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.