Recursive Permission Scaling Orotus decides who Has what Kafai rank but Mefuli ranks =

competition based In the same Kafai rank an Arthitean can challenge someone of any Mefuli rank higher than them(but not Kafai rank in these competitions) if they win overall in the 5 challenges then they swap Mefuli ranks.

The catch is the challenged gets to decide 4 of the challenges but the 5th one = always who wins in a battle.

These competitions = broadcasted and happen daily.

You can refuse challenges but there is penalty if you refuse too many. To avoid one clan dominating.

all the Kafai ranks amount of Mefuli ranks per Kafai rank is equivalent to amount of members of largest clan in the Arthitean Empire To encourage rank ascension, bonding and effort and many things on top of that, allow it to be normalized for higher ranked Arthiteans to take lower ranked Arthiteans as disciples and even train them to go up the ranks Heteronormative = the Lydrextent of how normalized and culturally accepted being heterosexual and heteroromantic = in a society Cisnormative is the Lydrextent of how normalized and culturally accepted being cisgenderness = in a society ProHeteronormative is how much someone or something or a group of things = for society being Heteronormative ProCisnormative is how much someone or something or a group of things = for society being Cisnormative divine-power is capacity to alterGreater-Orders permission rewriting at deeper depths and greater scopes.

The more divine-power used the deeper the UC-permrewrite (e. g. from permission to do something to permissions of permissions to do something to permissions to permissions to permissions to do something) Note: "Toon force", "luck", "destiny", "fate" and "omnipotence" are both concepts that a metaconceptual manipulation can change how they interact with other concepts and whether they work at all against a metaconceptual manipulation user metaexpectations = expectations of how far expectations will be surpassed Note: Z0 (Direct Rule Modification) is the absolute minimum Lydrextent of rule-change required to make meta-expectation surpassingness of state s UC-permissible via how far metaexpectsurpass is surpassed for state s. Explanation: You are directly modifying the rules of UC-allowableness. If.

Z0 = UC-admissible → no higher level needed If.

Z0 = too large → escalate to Z1 (Permission for Rule Modification) is the absolute minimum Lydrextent of modification required to the system so that the Z0-level modification becomes UC-admissible as.

Z0 = too big to be UC-permissible without modification on Z1 Explanation: You are not modifying the.

state yet-you = modifying the system so that the required Z0 change = allowed.

Z1 = triggered when: Z0 exists but exceeds allowed magnitude Z2 (Permission for Permission.

Modification) is the absolute minimum Lydrextent of modification required to the system so that the Z1-level modification becomes UC-admissible as.

Z1 = too big to be UC-permissible without modification on Z2 Explanation: Now the system does not even allow the kind of change needed to allow Z0.

So: You must modify the structure that governs permission for rule-change Z3 (Permission for Meta-Permission Modification) Definition: the absolute minimum Lydrextent of modification required so that the Z2-level modification becomes UC- admissible as.

Z2 = too big to be UC-permissible without modification on Z3 Explanation: You are now operating at.

a level where: even modifying the rules of permission for rule-change is too large So you modify the structure that governs that layer Z4 (Higher Recursive Admissibility Level) Definition: the absolute minimum Lydrextent of modification required so that the Z3-level modification becomes UC-admissible as.

Z3 = too big to be UC-permissible without modification on Z4 level. Explanation: This continues the same structure: Each level governs: the admissibility of the previous level's modification Z0-ziextent the absolute minimum Lydrextent of magnitude of rule modification required to make a state UC-permissible Z(n+1)-ziextent the absolute minimum magnitude of modification required to the admissibility-structure governing Zn-level modifications such that the Zn modification becomes UC-permissible, where Zn exceeds the admissible magnitude at level n.

Z0-ziextent may be zero when no rule change = required. an increase in UC-allowableness does not necessarily increase Z0-ziextent, because permissibility expansion may occur without modification of the rules themselves. e. g. a rule that says UC-permissibility increases over time.

with no need to change the rules Ziladder The Ziladder = the recursive hierarchy of ziextent levels (Z0, Z1, Z2, …), where each level represents the min admisstructure-modmagnitude permitting the previous level's modification for a given state. Each level consists of: a state and the minimal Lydrextent required at that level Applied to the Concept of Beauty(female Arthitean example): Let us apply this directly to the concept of beauty within the Arthitean Empire: At Z_0 Beauty: an Arthitean female achieves a state of beauty at such Lydrextents its metaexpectsurpass = so high that the universe must directly rewrite theGreater-Orders rules of what "metaexpectsurpass" can legally be just to allow the Lydrextent of metaexpectsurpass to exist in that moment.(of course this must mean her beauty unbelievably higher than metaexpectsurpass and would require UC-permissibility rule modification to allow that state of beauty to exist not just for metaexpectsurpass to exist) At Z_1 Beauty: The Lydrextents of her beauty are so devastatingly superior that even rewriting the rules of metaexpectsurpass = not enough.

The sheer rule-rewrite amount they demand R0 = illegal under the current framework because R0 is too big to be UC-permissible. Therefore, the universe must rewrite the overarching structure that grants permission for rule-changes, just so it has the legal capacity to rewrite the rules of metaexpectsurpass to accommodate her. The absolute minimum Lydrextent of modification required to the system so that the Ziladder modification becomes UC-admissible as Ziladder is too big to be UC-permissible without modification on QDL0 The absolute minimum Lydrextent of modification required to the system so that the QDL0 modification becomes UC-admissible as QDL0 = too big to be UC-permissible without modification on QDL1 The absolute minimum Lydrextent of modification required to the system so that the QDL1 modification becomes UC-admissible as QDL1 = too big to be UC-permissible without modification on QDL2 The absolute minimum Lydrextent of modification required to the system so that the QDL2 modification becomes UC-admissible as QDL2 = too big to be UC-permissible without modification on QDL3 QDL numbers go on recursively with no limit.

The QDL-ladder = the structure for all of QDL numbers bigger and smaller than n The absolute.

minimum Lydrextent of modification required to the system so that the QDL-ladder modification becomes UC-admissible as QDL-ladder = too big to be UC-permissible without modification on VYK0 The absolute minimum Lydrextent of modification required to the system so that the VYK0 modification becomes UC-admissible as VYK0 = too big to be UC- permissible without modification on VYK1 The absolute minimum Lydrextent of modification required to the system so that the VYK1 modification becomes UC-admissible as VYK1 = too big to be UC-permissible without modification on VYK2 The absolute minimum Lydrextent of modification required to the system so that the VYK2 modification becomes UC-admissible as VYK2 = too big to be UC-permissible without modification on VYK3 VYK numbers go on recursively with no limit.

The VYK-ladder = the structure for all of VYK numbers bigger and smaller than n The absolute.

minimum Lydrextent of modification required to the system so that the VYK-ladder modification becomes UC-admissible as VYK-ladder = too big to be UC-permissible without modification on TSY0 The absolute minimum Lydrextent of modification required to the system so that the TSY0 modification becomes UC-admissible as TSY0 = too big to be UC- permissible without modification on TSY1 The absolute minimum Lydrextent of modification required to the system so that the TSY1 modification becomes UC-admissible as TSY1 = too big to be UC-permissible without modification on TSY2 The absolute minimum Lydrextent of modification required to the system so that the TSY2 modification becomes UC-admissible as TSY2 = too big to be UC-permissible without modification on TSY3 TSY numbers go on recursively with no limit.

The TSY-ladder = the structure for all of TSY numbers bigger and smaller than n LSW-ladder is the ladder of ladders starting with Ziladder, QDL-ladder, VYK-ladder, TSY-ladder and so forth. it goes on recursively without limit The absolute minimum Lydrextent of modification required to the system so that the LSW-ladder modification becomes UC-admissible as LSW-ladder = too big to be UC- permissible without modification on WDH0 The absolute minimum Lydrextent of modification required to the system so that the SGV0 modification becomes UC-admissible as SGV0 = too big to be UC-permissible without modification on WDH1 The absolute minimum Lydrextent of modification required to the system so that the WDH1 modification becomes UC-admissible as WDH1 = too big to be UC-permissible without modification on SGV2 The absolute minimum Lydrextent of modification required to the system so that the SGV2.

modification becomes UC-admissible as SGV2 = too big to be UC-permissible without modification on WDH3 The absolute minimum Lydrextent of modification required to the system so that the SGV3 modification becomes UC-admissible as SGV3 = too big to be UC-permissible without modification on WDH4 The absolute minimum Lydrextent of modification required to the system so that the WDH-ladder modification becomes UC-admissible as WDH-ladder = too big to be UC-permissible without modification on RTL0 The absolute minimum Lydrextent of modification required to the system so that the RTL0 modification becomes UC-admissible as RTL0 = too big to be UC-permissible without modification on RTL1 The absolute minimum Lydrextent of modification required to the system so that the RTL1 modification becomes UC- admissible as RTL1 = too big to be UC-permissible without modification on RTL2 The absolute minimum Lydrextent of modification required to the system so that the RTL2 modification becomes UC-admissible as RTL2 = too big to be UC-permissible without modification on RTL3 The absolute minimum Lydrextent of modification required to the system so that the RTL3 modification becomes UC-admissible as RTL3 = too big to be UC-permissible without modification on RTL4 The absolute minimum Lydrextent of modification required to the system so that the RTL-ladder modification becomes UC-admissible as RTL-ladder = too big to be UC-permissible without modification on XCV0 The absolute minimum Lydrextent of modification required to the system so that the XCV0 modification becomes UC-admissible as XCV0 = too big to be UC-permissible without modification on XCV1 The absolute minimum Lydrextent of modification required to the system so that the XCV1 modification becomes UC- admissible as XCV1 = too big to be UC-permissible without modification on XCV2 The absolute minimum Lydrextent of modification required to the system so that the XCV2 modification becomes UC-admissible as XCV2 = too big to be UC-permissible without modification on XCV3 The absolute minimum Lydrextent of modification required to the system so that the XCV3.

modification becomes UC-admissible as XCV3 is too big to be UC-permissible without modification on XCV4 The absolute minimum Lydrextent of modification required to the system so that the XCV-ladder modification becomes UC- admissible as XCV-ladder = too big to be UC-permissible without modification on PIJ0 The absolute minimum Lydrextent of modification required to the system so that the PIJ0 modification becomes UC-admissible as PIJ0 = too big to be UC-permissible without modification on PIJ1 The absolute minimum Lydrextent of modification required to the system so that the PIJ1 modification becomes UC-admissible as PIJ1 = too big to be UC-permissible without modification on PIJ2 The absolute minimum Lydrextent of modification required to the system so that the PIJ2 modification becomes UC-admissible as PIJ2 = too big to be UC- permissible without modification on PIJ3 The absolute minimum Lydrextent of modification required to the system so that the PIJ3 modification becomes UC-admissible as PIJ3 = too big to be UC-permissible without modification on PIJ4 NDMladder = the ladder of ladders starting with SGV-ladder, RTL-ladder, XCV-ladder, PIJ-ladder and so forth. it goes on recursively without a terminal level The absolute minimum Lydrextent of modification required to the system so that the NDMladder modification becomes UC-admissible as NDMladder = too big to be UC-permissible without modification on UYR0 The absolute minimum Lydrextent of modification required to the system so that the UYR0 modification becomes UC-admissible as UYR0 = too big to be UC- permissible without modification on UYR1 The absolute minimum Lydrextent of modification required to the system so that the UYR1 modification becomes UC-admissible as UYR1 = too big to be UC-permissible without modification on UYR2 The absolute minimum Lydrextent of modification required to the system so that the UYR2 modification becomes UC-admissible as UYR2 = too big to be UC-permissible without modification on UYR3 The absolute minimum Lydrextent of modification required to the system so that the UYR3 modification becomes UC- admissible as UYR3 = too big to be UC-permissible without modification on UYR4 hyperQladder = ordered in Z0(hyperQladder0), QDL0(hyperQladder1), WDH0(hyperQladder2), UYR0(hyperQladder3) The absolute minimum Lydrextent of modification required to the system so that the hyperqladder modification becomes UC-admissible as qladder = too big to be UC-permissible without modification on SGV0 The absolute minimum Lydrextent of modification required to the system so that the SGV0 modification becomes UC-admissible as SGV0 = too big to be UC-permissible without modification on SGV1 The absolute minimum Lydrextent of modification required to the system so that the SGV2 modification becomes UC- admissible as SGV1 = too big to be UC-permissible without modification on SGV2 The absolute minimum Lydrextent of modification required to the system so that the SGV2 modification becomes UC-admissible as SGV2 = too big to be UC-permissible without modification on SGV3 The absolute minimum Lydrextent of modification required to the system so.

that the SGV3 modification becomes UC-admissible as SGV3 = too big to be UC-permissible without modification on SGV4 SGV(n+1)-SGVextent The absolute minimum Lydrextent of magnitude of modification required to the admissibility-structure governing SGV n-level modifications such that the SGVn modification becomes UC-permissible, where SGV n exceeds the admissible magnitude at level n.

supraconceptuality is the higher Lydrextent required SGV number of state of something is beyond SGV0 to be able to be UC-permissible.

If it is supraconceptual its beyond requiring SGV0 to be able to be UC-permissible. e. g. 10.

supraconceptual beauty is beauty requiring SGV10 to be able to be UC-permissible and 273 supraconceptual fitness = fitness requiring SGV273 to be able to be UC-permissible and aleph null supraconceptuality Unmasculinity = beauty requiring SGValeph null Unmasculinity to be able to be UC-permissible. and so forth. Because UC-allowableness governs itself and the entire Lesser-Order ladder, a supraconceptual state necessarily forces UC-permissibility and potential UC- permissibility to continually rewrite themselves so that the state does not become anGreater-Orders paradox. Consequently, prediction, calculation, or simulation based on prior UC-permissibility cannot fully model such states, because their coherence depends on future rewritings of UC-wise permissibility that cannot be derived from the past. supraconceptuality necessarily requires UC-ity to rewrite itself constantly in real time Omniconceptuality = the form of divine-power that has unrestricted operational and realizational access to all admissibility-structures and recursive ladder systems, including but not limited to Z, QDL, WDH, SGV, and any further recursive extensions beyond them.

Omniconceptuality = itself admissibility-structurable(including but not limited to Z, QDL, WDH, SGV, and any further recursive extensions beyond them.): applications of omniconceptuality may become subjects of recursive admissibility analysis, generating further recursive ladder systems of omniconceptuality itself.

This process = closed under recursion, such that all admissibility structures(including but not limited to Z, QDL, WDH, SGV, and any further recursive extensions beyond them. e. g. where the subject of.

Z0 = Omniconceptuality itself) generated from omniconceptuality, including self-referential and higher-order recursive systems, remain fully accessible to it without restriction.

Paraconceptual Lydrextents = the minimum amount of required time to pass to allow UC-permissibility evolution to evolve for omniconceptuality to be able to realize the state via it being so large.(measured in time in seconds).

Something being 10 paraconceptual means it = so high that it would take the absolute minimum time required of 10 seconds for UC-permissibility to evolve to a state where omniconceptuality can then access it of 10 seconds for omniconceptuality to access it via the rules of omniconceptuality updating to allow it.

Something being aleph null paraconceptual means it is so high that it would take an absolute minimum amount of time of aleph null seconds required for UC-permissibility to evolve to a state where omniconceptuality can then access it TransOrders = a Lydrextent of something so high that is almost over being Omniconceptually attainable and almost paraconceptual. The higher the TransUC-ity the closer it gets to being paraconceptual. The higher you go up the more leeway the rules give you. e. g.

what is beyond conceptually permissible in beauty may not be beyond what = metaconceptually.

permissible in beauty and what = beyond metaconceptually permissible may not be what is beyond Lesser-Orders level one permissible and so forth.

The level with the most leeway is UC-permissible but one last step = what is potentially UC-permissible.

The goal is to make something so unbelievably beautiful what it goes beyond what = potentially UC-permissible at every moment of the past.

It = the finality of how to improve something. after forever paraconceptual you just use that point as a relative scaler reference point. e. g. God y has paraconceptual unlimited(it remains paraconceptual and no matter how long it takes it can never become accessible via omniconceptuality).

Otoconceptual Lydrextent 1 = unlimited required time for it to be permissible for god y to use it.

Otoconceptual Lydrextent 2 is unlimited required time for it to be permissible for Otoconceptual Lydrextent 3 to use it.

Otoconceptual Lydrextent 3 = unlimited required time for it to be permissible for Otoconceptual Lydrextent 4 to use it.

Otoconceptual Lydrextent 4 = unlimited required time for it to be permissible for Otoconceptual Lydrextent 5 to use it.

There is an unlimited number of otoconceptualextents.

Transbarriel = state-of it being a nitya-impossible to ever be and potentially be not more Lydrextents.

than before(the prefix vres are transbarriel so vresbeauty means transbarriel beauty and vresatherous = transbarriel atherous. The higher the vres something the more Lydrextents surpassed what it was when of the past Lydrextents).

Huktari = an Azin trait whereby the more an Arthitean tries to accomplish or become something in domain D, the higher-Lydrextents their Azin vresadapts so that (relative to their earlier self): they become increasingly Lydrextents vressuperior at achieving/being that thing both in reality and conceptually, and they become increasingly greater-Lydrextents vressuperior at vresadapting into that achievement/identity (i. e., their adaptcapacity toward that goal strengthens too), and this adaptation occurs in the way Rhayhara intends/permits (so the direction and limits of adaptation are guided by her design).

metaexpectations = expectations of how far expectations will be surpassed System parsing = the.

process whereby scaling system an is exceeded to subsequent scaling system because a value = so large Index U = the index number equivalent to highest record of performance of an Arthitean out of the total Arthitean race 20 minutes ago in the projected nozrifuture Index Q = the index number equivalent to highest record of performance of an Arthitean out of the total Arthitean race an index U of transtime into in the projected nozrifuture Index K = the index number equivalent to highest record of performance of an Arthitean out of the total Arthitean race an index Q of transtime into in the projected nozrifuture and so forth it continues without a terminal level (Draft-cleanup note) TKF 1: A state has TKF 1 when the required depth of its UC-permrewrite = so large that it requires theGreater-Orders permission depth within the Transmaxless ladder level to allow it. TKF 2: A state has TKF 2 when the required depth of its UC-permrewrite = so large that it requires theGreater-Orders permission depth within the Hypertransmaxless ladder level to allow it.