Recursive Pronouns
Recursive Pronouns are a type of pronoun that add onto themselves with time it is used in a conversation. It can be considered a neopronoun, however it can also be used solely with non-neopronouns as well. It resets each conversation, so people don't need to remember the times used for the set forever. Generally, it is alright to ask the user how many times it is used.
History
Recursive Pronouns were originally made and coined by Hal from the Glitched Amethyst System on October 6th 2021 (with Hal also writing this page, and designing the flag).
How To Use
Recursive Pronouns are written as ( pronoun/set [_,_]). The first value indicates the highest it can go, with the second value indicated how many time it is written after passing the limit. The number at the end is pronounced at how you'd write the number, ie; five for (5). If unclear, you can elaborate when asked on what is added on each time (by adding a +___ or ___+ to it to indicate if it goes before or after, but usually assume it goes before)
Examples
(bit/bitself [3,2]). "Hey, have you talked to bit?" "bitbit is pretty cool, you should talk to bitbitbit!" "Go and grab bitbit(4)s coat!"
(✨/✨self [4,4]) "Look at ✨! ✨✨ looks fabulous! I wonder where ✨✨✨ got ✨✨✨✨s outfit? ✨✨✨✨(5) has a nice hat! ✨✨✨✨(6) also has cool glasses!
([+x] she/her [2,1]) "she's so nice, I wanna be herx friend! Wonder what shexx thinks of me? Guess I should ask herx(3) about how shex(4) feels about me!
([█+] █/█ [2,4]) "I like █! ██ is very nice to me, especially when ████(3) uses my pronouns! I should use ████(4) pronouns more often!
Advanced Situations That You Will Likely Never Run Into™
(Most people with recursive pronouns will never experience this, but here it is for the theoretical situations that may arise.)
Other Situations
If the thing to be added has a plus on both sides, then add it to the beginning and end. ([+01+] 01/01self [_,_]) for example.
If the thing to be added has a minus instead of a plus, instead remove that character from the pronoun, whichever appears first and/or last (depending on when it appears). If you run out of that letter, don't remove any other letters.
If it has more than one plus or minus, do it that many times.
Unusual Situations with the Max Value
If a max value of a recursive-pronoun set is 0, it is always used as if it had reached the limit. Example: ([+$] it/itself [0,3]) would be it$$$(1), then it$$$(2), etc
If a max value of a recursive-pronoun set is -1, it has no maximum limit. This may get out of hand fast, so I recommend using a limit instead.
Unusual Situations with the Set Value
If a set value of a recursive-pronoun set is 0, after reaching the limit, nothing is added on top of the base. Example: ([+he] she/her [2,0]) would be she => shehe => she(3)
If a set value of a recursive-pronoun set is -1, remove the left bracket from the number. Example: after 14 uses, ([uw+] uwu/uwuself [3, -1] would be uwu14)
If a set value of a recursive-pronoun set is -2, remove the right bracket from the number as well. Example: after 14 uses, ([uw+] uwu/uwuself [3, -2] would be uwu14
If a set value of a recursive-pronoun set is -3, remove the rightmost number from the counter. Repeat this for every number lower (-4, etc) in the set value. Example: after 14 uses, ([uw+] uwu/uwuself [3, -2] would be uwu1. If there would be no number written, then don't write the number. For example, using this set 4 times would just write "uwu"
If a set value of a recursive-pronoun set is positive and a decimal, use that many letters out of the word (starting from the left). Example: ([+xe+] xe/xem [2,0.5] would go xe=>xexexe=>xxex(2).
If the decimal must be rounded, round up. Example: ([+they] she/her [0,0.4] would become sheth(1) and herth(2)
If the decimal is negative, remove that many letters from the base pronoun set. Example: ([+a] AAAA/AAAA [1,-0.45]) would become AAAA -> AA(2)
If the decimal is negative and less than -1, then both negative rules apply. Example: ([+pi] pi/piself] [2,-2.5]) would be pi -> pipi -> p3
Rounding applies seperately for each part of the set. Example: ([+🐉] dragon/dragonself [0,-0.9] would result in (1) from dragon, but f(2) from dragonself, because it is longer and rounds to 9/10 letters being removed.