I am seeking advice or an answer to the following question that is bugging me:
How long a list of non-equivalent pure monadic schemata containing only the predicate letters “F” and “G” is there?
I can get an answer for one predicate letter, but I do not Know two nor do I know three. I would like to find the general formula for this. that is, given n predicate letters, there will be z amount of non-equivalent schemata.