Conversation
Notices
-
@nyoom Can do so with Replacement on {A} with φ(A, B) : ∃g = {A, {A, B}}(∀v(v ∈ B ⇐⇒ v = A ∨ ∃k ∈ B(v ∈ k))), but that implicitly uses recursion. It's possible that's fine and I literally don't need anything else.
-
@chris9x @nyoom @MercurialBlack no thats garbage advice you just need to learn java, the best coding language and actually the official coding language of the fediverse
-
@Soy_Magnus @nyoom @chris9x You can make webpages with java?
-
@MercurialBlack @nyoom Please learn CSS if thou shalt engage in such an action!
-
@nyoom STG remind me to start a webpage with all these replacement formulas written down because I'm needing to generate them from scratch
-
@MercurialBlack @nyoom @chris9x you can litterally do EVERYTHING wih java. If you somehow found some exploit garbage that breaks java, just use pascal, the second best coding language of all time