home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.lang.c:16079 comp.lang.c++:15867 comp.lang.pascal:6377 comp.lang.misc:3523
- Newsgroups: comp.lang.c,comp.lang.c++,comp.lang.pascal,comp.lang.misc
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!saimiri.primate.wisc.edu!ames!decwrl!concert!sas!mozart.unx.sas.com!sasghm
- From: sasghm@theseus.unx.sas.com (Gary Merrill)
- Subject: Re: Software design =/= Programming
- Originator: sasghm@theseus.unx.sas.com
- Sender: news@unx.sas.com (Noter of Newsworthy Events)
- Message-ID: <BxAsyI.Hyw@unx.sas.com>
- Date: Fri, 6 Nov 1992 14:15:54 GMT
- References: <mazz.719989080@pluto> <josef.720690811@uranium> <1992Nov04.073218.11970@cadlab.sublink.org> <1dcuutINNi8t@agate.berkeley.edu>
- Nntp-Posting-Host: theseus.unx.sas.com
- Organization: SAS Institute Inc.
- Lines: 22
-
-
- In article <1dcuutINNi8t@agate.berkeley.edu>, faustus@ygdrasil.CS.Berkeley.EDU (Wayne A. Christopher) writes:
- |> In article <1992Nov04.073218.11970@cadlab.sublink.org> martelli@cadlab.sublink.org (Alex Martelli) writes:
- |> > The point of Goedel's Theorem is, that for *ANY* formal system "powerful
- |> > enough" ... there will be *true* statements about the formal
- |> > systems that cannot be proven from that set of axioms!!!
- |>
- |> Not exactly -- what it says is that for any set of axioms A there will
- |> be statements S such that A does not imply S and A does not imply not
- |> S. The notion of truth doesn't come into it, since in a formal system
- |> either something is provable or isn't.
- |>
- |> Wayne
-
- Since the systems in question are classically two-valued, then either
- S is true or ~S is true. While what you say about Goedel's theorem
- is correct, truth *does* "come into it" quite easily. See Tarski's
- theorem.
- --
- Gary H. Merrill [Principal Systems Developer, C Compiler Development]
- SAS Institute Inc. / SAS Campus Dr. / Cary, NC 27513 / (919) 677-8000
- sasghm@theseus.unx.sas.com ... !mcnc!sas!sasghm
-