Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 5/3/83; site uwvax.ARPA Path: utzoo!linus!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.ARPA> Date: Thu, 14-Jul-83 00:31:50 EDT Article-I.D.: uwvax.975 Posted: Thu Jul 14 00:31:50 1983 Date-Received: Sat, 9-Jul-83 13:56:43 EDT References: <254@isrnix.UUCP>, <237@cbscd5.UUCP> <2134@rochester.UUCP> Organization: U of Wisconsin CS Dept 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