1
$\begingroup$

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.

  • 2
    What are non-equivalent pure monadic schemata?2012-10-28
  • 0
    They are schema that do not have the same interpretation for every universe of discourse. So, (∃x)(Fx V Gx) is eq. to (∃x)Fx V (∃x)Gx. While (∀x)(Fx V Gx) is not eq.to (∀x)Fx V (∀x)Gx. Pure Monadic means that you can not have any unbound variables, and the main connective can not be a negation. So, you can't have something like ~∃xFx2012-10-28

2 Answers 2