@mu4 i think you have the basic idea correct but the order is more flexible.
Once you have more than one dichotomy, you can begin to do a parity check. I see it as a dialectic process where the goal is to increase confidence and the problem becomes more complex as you go.
In my paper, all I did was solve for type and then fill in the remaining dichotomies to save space, but you can calculate each point one by one.
Basically these are the subgroups that I will get into later in the paper. I have a lot more to write about this topic.
# of independent dichotomies # of dependent dichotomies in system that can be used for a parity check total # of dichotomies in system, excluding the identity element (points) total # of small groups in system (lines) total # of dyad subspaces in system (surfaces) number of possible types 1 0 1 0 0 8 2 1 3 1 0 4 3 4 7 7 1 2 4 11 15 35 15 1