Sujet : Re: H(D,D) cannot even be asked about the behavior of D(D) --- Truth Itself is not Broken.
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theory sci.logicDate : 15. Jun 2024, 17:24:48
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v4kf8g$2219$7@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
User-Agent : Mozilla Thunderbird
On 6/15/24 12:11 PM, olcott wrote:
On 6/15/2024 10:52 AM, Richard Damon wrote:
On 6/15/24 11:41 AM, olcott wrote:
On 6/15/2024 10:18 AM, Richard Damon wrote:
On 6/15/24 11:03 AM, olcott wrote:
>
{thing} is the root of the whole knowledge tree.
>
And what DEFINES {thing}?
>
>
Its constituents.
>
In other words, the definition is circular.
>
If you can't understand that a type hierarchy is not circular
then your knowledge is woefully inadequate to continue this
discussion.
But the type hierarchy is not the definitions of the type hierarchy.
You can not DEFINE the hierarchy without reference to either circular defintions or terms outside your system.
>
and what distingueshes the things derived from {thing}
>
Their placement in the inheritance hierarchy.
>
So, what distinguishes the first thing derived from thing from the second? Only what derives from them, in that case, again, your definitions are circular.
>
If you can't understand that a type hierarchy is not circular
then your knowledge is woefully inadequate to continue this
discussion.
And without definitions for the "types", it is just a meaningless tree of undefined terms. But then, that somehow seems normal for you systems, you throw out terms you don't understand and see what sticks to the wall, which results in a zero-knowledge/truth system.
>
All these need definitions (what are part of truth=making) from OUTSIDE the system.
>
>
The accurate verbal model of the actual world encoded in
something like simple type theory.
>
In other words, you are just ADMITTING, that everything in the model gets its "meaning" from EMPRICAL TRUTH as looking at the actual world, and derives from meaning from the "poorly defined" natural languages of that world.
>
Not at all.
Sure seems like it.
So, NOTHING in that system has truth-makers in the system, and NOTHING is actually "analytically true" as everything fundamentally devolse to an empirical truth.
>
An accurate verbal model of the actual world does specify
all of the knowledge that can be expressed using language.
And the word definitions of natural language are circular.
>
>
There is a fundamental problem of first principles that need to stand on their own without support from anything in the system.
>
>
The definition of the meaning of a term is the truthmaker
for this term. The terms that this definition is composed
of have their own definitions. This is recursively quite
deep yet zero actual cycles.
>
And what makes that definition true?
>
>
What makes puppies not a type of fifteen story office building?
>
Because we have defined the terms that way.
>
Yes, you are starting to get this.
Fifteen story office buildings never wag their tail.
>
But there is not fundamental truth-maker to establish any of this.
>
It is all semantic interconnections specified as something like
a type hierarchy.
Excpet that definitions become circular or reference out of system definitions.
>
>
The correct verbal model of the actual world encodes relations
between types of things as stipulated relations between finite
strings.
>
And stipulations don't have truth makers in the system.
>
The verified fact that puppies really do wag their tails
is the truthmaker for {puppies wag their tails}.
>
In other words, your whole system is just based on emperical truth, and analytical truth doesn't actually exist.
>
Right there really is no such thing as words thus you
never really said that.
But you seem to be using the Natural Language meaning of the words, which are just "Emperical" as they are based on truths that are observed and not analytically defined. The "Natural" part of Natural Language means that it is as found in "Nature", i.e. the real world. Ultimately, the Natural Language meaning of the word "Cat" relies on the observation and sense data of how that word is used in reality. We might then formalize it some, but the core meanings of Natural Language are learned experimentally, not logically.
>
>
That we have many human languages that encode the same relations
between types of things in the world and each one does it using
different finite strings proves the stipulated aspect of this.
>
And Human Languages have circular definitions for words,
>
No you are wrong.
Provide a counter-example.
it is always a type hierarchy.
>
Show me a word that isn't defined from other words, in other words, show me a root.
>
A tree with a root must either be infinite in depth or have cycles.
>
No and you cannot show otherwise.
Willard Van Orman Quine got totally confused by this and got
most everyone else to follow his inept reasoning.
Try to show one that doesn't
He had no idea how the definition of bachelor(x) and ~Married(x)
could be defined in a non-circular way.
(a) first define human
(b) next defined married
(c) next define bachelor as ~married.
Except that ISN'T the definition of "bachelor", as he points out, it has many meanings. So, your argument is based on a LIE.
>
thus you can not trace them to a "root". We need to start with a set of first concepts that we agree OUTSIDE OF LANGUAGE what they mean, and express these definitions as loops within the language.
>
By the theory of simple types I mean the doctrine which says that the objects of thought ... are divided into types, namely: individuals, properties of individuals, relations between individuals, properties of such relations, etc.
https://en.wikipedia.org/wiki/History_of_type_theory#G%C3%B6del_1944
>
This can be further simplified to types of relations between
finite strings.
>
And ultimately needs to rely on things not established by Truth-Makers in the system.
>
The definitions of terms specified as relations between other terms
are the truthmakers for these terms.
And those definitions need truth-makers, as language is circular or out-side refering.
>
These words have no "truth-makers"
>
Incorrect.
>
So, what are they?
>
Semantic gibberish just like "this sentence is not true".
In other words, you are ADMITTING that the word you use don't actually have meaning, so there is not truth-makers for them.
>
>
How can you write a "defintion" for the first term of your system?
>
>
It is the same sort of knowledge tree that the Cyc project uses
to encode an accurate verbal model of the actual world.
>
and, as I asked, how do they actually DEFINE {thing} or diferentiate between the sub-concepts off of {thing}
>
{Thing} is the root and is defined by itself constituents types of things.
>
So, it is either defined based on the ENGLISH sentence, and thus we pull enough of English into the system to define it, and get into the cycles of English, or
>
THERE ARE NO CYCLES IN A TYPE HIERARCHY.
But there is in the definition of the terms.
Without defintions, the hierarchy is just gibberish.
Date | Sujet | # | | Auteur |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 373 | | olcott |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 10 | | joes |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 4 | | Mikko |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 3 | | olcott |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 2 | | Mikko |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 1 | | olcott |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 5 | | olcott |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 4 | | joes |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 3 | | olcott |
10 Jun 24 | Re: D simulated by H unproved for THREE YEARS --- | 2 | | joes |
10 Jun 24 | Re: D simulated by H unproved for THREE YEARS --- | 1 | | olcott |
10 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- | 362 | | Richard Damon |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- Richard admits his error | 361 | | olcott |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- Richard admits his error | 360 | | Richard Damon |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- Richard admits his error | 359 | | olcott |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- Richard admits his error | 358 | | Richard Damon |
11 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 357 | | olcott |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 355 | | Richard Damon |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 354 | | olcott |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 302 | | Python |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 301 | | olcott |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 300 | | Richard Damon |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 299 | | olcott |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 298 | | Richard Damon |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 297 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 296 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 295 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 288 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 287 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 285 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 284 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 283 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 282 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 281 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 280 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 274 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 273 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 272 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 271 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 270 | | Richard Damon |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 269 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 1 | | joes |
14 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 267 | | Richard Damon |
14 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 236 | | olcott |
14 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 235 | | Richard Damon |
14 Jun 24 | H(D,D) cannot even be asked about the behavior of D(D) | 234 | | olcott |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 231 | | Richard Damon |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 230 | | olcott |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 229 | | Richard Damon |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 228 | | olcott |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 169 | | joes |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 168 | | olcott |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 1 | | Richard Damon |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 166 | | joes |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 2 | | olcott |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 1 | | Richard Damon |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 163 | | Mikko |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 162 | | olcott |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 1 | | Richard Damon |
16 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 160 | | Mikko |
16 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 159 | | olcott |
17 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 158 | | Mikko |
17 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 157 | | olcott |
18 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 156 | | Mikko |
18 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 155 | | olcott |
18 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 154 | | Mikko |
18 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 153 | | olcott |
18 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 152 | | Mikko |
18 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 151 | | olcott |
19 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 150 | | Mikko |
19 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 149 | | olcott |
20 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 148 | | Mikko |
20 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 147 | | olcott |
20 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 146 | | Mikko |
20 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 145 | | olcott |
20 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 5 | | joes |
20 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 4 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 3 | | Fred. Zwarts |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 2 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 1 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 56 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 55 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 54 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 53 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 52 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 51 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 50 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 47 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 46 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 45 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 44 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 43 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 42 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 41 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 40 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 39 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 38 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 37 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 36 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 35 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 34 | | Richard Damon |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply | 2 | | olcott |
21 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 83 | | Mikko |
15 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 58 | | Richard Damon |
14 Jun 24 | Re: H(D,D) cannot even be asked about the behavior of D(D) | 2 | | joes |
15 Jun 24 | H(D,D) cannot even be asked about the behavior of D(D) V2 ---ignoring all other replies | 12 | | olcott |
15 Jun 24 | H(D,D) cannot even be asked about the behavior of D(D) V3 ---IGNORING ALL OTHER REPLIES | 18 | | olcott |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 5 | | joes |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 1 | | joes |
13 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules | 6 | | joes |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 51 | | Richard Damon |
12 Jun 24 | Re: D correctly simulated by H proved for THREE YEARS --- rewritten | 1 | | Fred. Zwarts |