Talk:Abstract Wikipedia

(Redirected from Talk:Wikilambda)
Latest comment: 5 months ago by Sannita (WMF) in topic Outdated?

Outdated?

edit

It seems to me that a content page entitled "Abstract Wikipedia" should include the current state of the project. The page describes the project schedule, but does not describe what been done and what remains to be done. For example, did the "Abstract Wikipedia part of the project ... start in roughly 2022"? Did the Wikifunctions Beta launch in 2022? Finell (talk) 04:17, 3 October 2023 (UTC)Reply

@Finell Thanks for reporting this, and sorry for taking this long to answer. Yes, the main page needs to be updated, and we will do it soon. We just have been caught in a lot of work behind the scenes since the launch of the project. Sannita (WMF) (talk) 15:17, 8 February 2024 (UTC)Reply

Suggestions

edit

I have some criticisms. In this article, these examples are given:

subclassification_string_from_n_n_language(n_wikipedia, n_encyclopedia, English)

English : Wikipedias are encyclopedias.

subclassification_string_from_n_n_language(n_wikipedia, n_encyclopedia, German)

German : Wikipedien sind Enzyklopädien.

Subclassification(Wikipedia, Encyclopedia)

English : Wikipedias are encyclopedias.

German : Wikipedien sind Enzyklopädien.

However, what bothers me is the claim that this is language-neutral, when it's so obviously Anglocentric. If it were German-centred instead, for example, the code would look like this instead:

Zeichenfolge_für_die_Unterklassifizierung_von_n_n_Sprache(n_Wikipedia, n_Enzyklopädie, Englisch)

Zeichenfolge_für_die_Unterklassifizierung_von_n_n_Sprache(n_Wikipedia, n_Enzyklopädie, Deutsch)

Unterklassifikation(Wikipedia, Enzyklopädie) (thanks, google translate!)

So, what's the point of lying? Also, I think that the functions should be stratified (to avoid nasty things like self-referential paradoxes), like predicate logic or set theory. A predicate is a special case of a function whose output is T or F. Logical operators are similar in this regard, except that the input is also T or F.

If we're mirroring predicate logic, then we could instead have:

Encyclopedia(Wikipedia) or Enzyklopädie(Wikipedia)

Similarly, the set {x|Encyclopedia(x)} (or {x|Enzyklopädie(x)}) can be defined.

Quantifiers should also be included, so that one could state that for example, all humans are mortal. Now, I have an idea for stratification (if you dislike it, feel free to modify it- this is purely illustrative. If I'm unclear, feel free to ask for clarification- I'm $h!t at explaining things :))

0th order: Objects

1st order: Functions (incl. predicates) between objects (we'll state that these functions quantify over objects, in analogy to predicates in predicate logic), statements that only quantify over objects, and sets defined by said functions. All of these collectively will be referred to as first-order objects.

2nd order: Functions between first-order objects (but no higher), statements quantifying over first order objects (but no higher), and sets defined by said functions. All of these collectively will be referred to as second-order objects.

3rd order: Functions between second-order objects (but no higher), statements quantifying over second-order objects (but no higher), and sets defined by said functions. All of these collectively will be referred to as third-order objects.

etc.

Transfinite induction is obvious:

ω-order: Functions between nth-order objects (for n<ω), statements quantifying over nth-order objects (for n<ω), and sets defined by said functions. All of these collectively will be referred to as ω-order objects. (this can be applied to other limit ordinals too)

All functions, statements, and sets will be assigned the lowest ordinals consistent with the definitions provided Username142857 (talk) 17:34, 2 January 2024 (UTC)Reply

Return to "Abstract Wikipedia" page.