I am finishing writing a formal description of what I call “pointfree funcoids” (it’s not relevant what they are) between partially ordered sets.
Now I want Codex to produce for every theorem about pointfree funcoids, a special case of the theorem, when the partially ordered sets are necessarily the sets of filters on a set. In simple words, I want to automatically produce for every theorem its certain special case.
What level of reasoning (Low…Extra High) should I set for this task? At one hand, the task involves many theorems, so the level should probably be high. At the other hand, specializing each theorem is expected to be relatively easy, so the level should probably be not very high.
Is the level about total amount of reasoning after a prompt, or is is about how meticulously each subtask is done?