The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA PHILOSOPHIA - Issue no. 1-2 / 2001  
         
  Article:   AN ANALYSIS ON A MACHINE TYPE GÖDEL.

Authors:  MARCEL BODEA. 		 
       
         
  Abstract:  The formal domain of abstract mathematical systems and the propositions provable in them (the essentials of Gödel’s ideas) can be illustrated using a ‘machine language’: The Gödel’s machine. This article was written primarily as an investigation and introduction to incompleteness theorems in a way wich is a simplifying factor. We tried to show how a certain computing machine can have very general features in subject to Gödel’s argument. We belive that the proofs we give are unusually simple. We then can turn to some incompletness arguments in a general setting. This could be an creative puzzles-aid to teachers of philosophical-logic at either the high school or college level.  
         
     
         
         
      Back to previous page