And that is clearly colouring everything you say. And it's completely irrelevant. Turning it into a program cannot change a fundamental logical problem. It's not like people in the early 20th century didn't know about hierarchies or formal procedures.
Maybe they simply weren't motivated to apply the ideas the way I'm applying them. And since I brought an unbiased source supporting this idea, this is not about me. Unless you can show where the wiki article is wrong, then a conglomerate is a logically consistent, all inclusive structure with the same properties of a category of all categories. But that is not the same as a set of all sets.
Anyway, crying out "Blasphemy! This is a fundemental problem." isn't a valid argument. You are claiming that what I have defined is not all-inclusive. I am arguing it is. You have been repeatedly redefining what I've brought saying it's a list, it's a set, and there is no difference. Because of that I brought examples that are different: Taxonomy tables, Org charts, Family trees, Directory structures, File Systems, the periodic table, online full backups ( snapshots ), ACL (Access Control Lists). All of these show that all inclusive structures do exist. Even a book, any book, is an all-inclusive conglomerate of the concepts contained in the book.
What have brought shows:
1) What I am defining is not a set. Comparing it to a set is a false equivilance.
2) An all inclusive conglomerate is logically possible. It has not been disproven by anyone.
To refute #1, you need to show that what I'm defining is equivilant to a set. It can't be done. To refute #2, you need to show that the wiki article is wrong. Maybe you can do it, but I doubt it. I have many strong reasons to believe I am right and you are wrong about this. So far you have only brought "Blasphemy".
We're starting to get into some actual attempts at refutation. But the redefining of Literal Infinity into a set is a failed dead argument. And claiming it can't be done on principle is also a failed argument. Considering the concept "all concepts which don't contain themself" is basically dead. Unless there is something more than semantics, you'll need another example of a concept which cannot be included.
OK?
This is set notation gibberish. I mean, each line means something but there is no connecting logic.
Not really. It looks like you've lost, or are ignoring, the context. That's not my fault.
Great. ( Not gibberish then )
{A} ∈ {A} = FALSE
{A} ⊂ {A} = TRUE
In what context?
The context is: Self-reference. {A}={A}.
This reminds me of your objection to ∞+∞=∞, as if I didn't intend for ∞=∞.
( Not gibberish, is it? What I wrote
is true, if the context is maintained from our conversation. )
P=∀Concept (Concept ∉ Concept → (Concept ∈ Concept = FALSE))
P is a truism!? No.
That's a claim. I disagree. It's always true. And ( if you can evaluate it as "Not a truism" then it's not gibberish, is it? )
The burden is on you. Please bring an example where P as defined above is false AND holding the necessary condtions:
P=P
Concept=Concept
False=False
P AND Concept AND False =/= {}
IOW, Please bring 1 example where it is false. Please no pedantic nonsense. The context is self-reference. All of these concepts exist. Each word means 1 and only 1 thing.
P ∉ P
P ⊂ P
No context again.
The context is self reference. P=P. What I wrote is true. It's not my fault the context is ignored or lost. It's not gibberish; it's 100% true.
The point of these examples is to show:
1) There is an important difference between "literal membership" and "included in the concept".
2) "IS-CONTAINED=FALSE" describes NOT "literal membership". But that does not necessarily mean that it is NOT "included in the concept".
P is defined (using 'set' in the informal sense) as the set of all sets A for which A ∉ A (you shouldn't put brackets round a symbol that represents a set). Also P ∈ LI.
Just because you
can define a concept in a way that produces a paradox doesn't mean it
needs to be defined that way. You would need to take what I defined and show that it, infact,
is equivalent to what you are defining. So far it's just been "If I define P like this, it produces a paradox." But I can define the concept and produce the the results which match the condition without the paradox.
So,
P = {x ∈ LI | x ∉ x} and P ∈ LI.
The problem is that P ∈ P ⇒ P ∉ P and P ∉ P ⇒ P ∈ P.
Good. Using this precise definition, P ( which is not the same as the P I defined ) as you have defined it above would not be a category. It would be a concept with the attribute+relationship pair ( among others ):
IS-CONTRADICTION=TRUE
See how simple that is. It would belong to the category with the attribute-relationship-filter: "IS-CONTRADICTION=TRUE" along withthese other contradicting concepts:
Married-Bachelor
Square-Circle
True-Lies
Partial-Circumcision
Military-Intelligence
Both a query and its result (when run on LI) are concepts. If you put the concepts into LI then you have the above problem and if you don't, I can take any result of any query and add it to LI without a duplication and the whole idea of it being all-inclusive breaks down.
No. There is no problem. You defined a contradiction and it fits neatly into Literal Infinity right next to the other contradictions. So far you have not brought any example of a concept which is not included.
Literal infinity is all inclusive. Nothing is missing. Nothing can be excluded. All the results are included. Everything you can think of and more is included.
If you can think of something that isn't, then, you win.
You really, really need to give up the idea that making this a program and a database is going to make any difference at all to the underlying logic.
Why? Your example when properly defined is included as a contradiction. My corresponding concept which Selects for all lacking literal self-reference also works. It produces results which are all the concepts which don't include itself. It does include a link to itself 1 time in these results in the same way that a subset relationship is true for itself. But it's not a literal self reference which will cause any problems.
Either the results of all queries are literally already in the database you're querying or they aren't and can therefore be added without duplication.
The results of all queries are literally already in the database. If you define a contradiction, then there will be no results. For any non-contradicting query, those results are already included. If you need a duplicate copy. That can be accomplished too.