Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!wivax!decvax!microsof!uw-beaver!cornell!vax135!floyd!cmcl2!philabs!seismo!uwvax!myers
From: myers@uwvax.UUCP
Newsgroups: net.politics
Subject: Re: Limited Laws for All Time? (Godel theorem revisited)
Message-ID: <975@uwvax.UUCP>
Date: Thu, 14-Jul-83 21:31:50 EDT
Article-I.D.: uwvax.975
Posted: Thu Jul 14 21:31:50 1983
Date-Received: Tue, 12-Jul-83 04:54:48 EDT
References: <254@isrnix.UUCP>, <237@cbscd5.UUCP> <2134@rochester.UUCP>
Lines: 13

Yes, Godel's theorem applies only to systems dealing with relationships
between integers.  The interesting thing about integers, though, is that
symbols in ANY formal system can be represented as integers!

Hence, any relationship expressable withing a formal system is representable
as a relationship between integers.  That is the amazing thing about
Godel's theorem.  What the theorem says about formal systems dealing with
non-negative integers is applicable to ALL formal systems.

If ya don't believe me, just read Chapter 1 of "Theory of Computation"
by Brainerd and (Madison's own) Landweber.  It's clear enough.

Enjoy, Jeff Myers@uwvax