in normal day scratch the normal states that we normally see are true (1) and false (0) booleans, these can even be found in LSPL anarchy sometimes. if boolean = <1+1=2> then it’ll be TRUE which corresponds to “1” if boolean = <1+1=3> then it’ll be FALSE which corresponds to “0” this project use ISM’s else to completely rule out all numerical states AND string states. It is fairly obvious that string states are likely more powerful than number states OR less likely, each number state corresponds to a specific string state (such as “0” is to FALSE AND “1” is to TRUE) this makes the state stronger/hidden than ANY state using numbers OR strings, furthermore, we restrict this inaccessible state to have no blank strings OR empty sets.
introducing… BSA! (Boolean State Abuse) BSA is a fairly strong branch of BLA. this project is arguably stronger than catafinity credits: @Martinez135 Dagger ordinals (†) are Infinite State Machine ordinals that are constructed using the Infinite State Machine's default else statement; Absolutely Everything Else (as in every state other then the one that lead to the Else condition). †-Ordinals are only constructible and representable as formal ordinals using paraconsistent logic and an Axiom that converts paraconsistent statements into ordinal values.
