Abstract

The formal domain of abstract mathematical systems and the propositions provable in them 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