From Newsgroup: sci.logic
On 13/07/2026 00:23, olcott wrote:
On 7/12/2026 4:16 PM, Tristan Wibberley wrote:
On 28/04/2026 11:35, Alan Mackenzie wrote:
[ Followup-To: set ]
In comp.theory Scott Hoge <nospam@nospam.com> wrote:
...
You're correct that the proof does not refer to directed graphs.
What I want to argue, rather, is that such graphs can be used to
/visualize the meaning/ of the G||del sentence.
...
In the graph you drew, (still in the quoted text above), each node is
identical to the others.
Yes, a "network" (or the DAG variant of a network) is required. A
network is a graph with labelled nodes.
That can get the evaluation of an expression stuck
in an infinite evaluation loop on the basis of the
cycle in its directed graph. Knowledge is acyclic.
Knowledge is not acyclic. There are many kinds of telations between
the parts of knoledge, as can be determiend by asking questions like
"how do you know" and "where did you get the idea" and "what else
does the same" and so on and analyzing the answers. Some of these
relatoins lead to opposte directions.
--
Mikko
--- Synchronet 3.22a-Linux NewsLink 1.2