Let there be a composite statement R, consisting of 2 component statements P and Q. There are 4 possibilitues for P and Q, they are either (T,T), (T,F), (F,T), or (F,F). Or let T=1 and F=0, and replacing the variables you'd have (1,1), (1,0), (0,1), or (0,0). Now depending on the composite statement R, each possibility for PxQ will lead to either 1 or 0 for R, so each composite statement R should have its own individual set of 4 values, where it's mapping each element of PxQ to either 1 or 0. I'm having some trouble describing these values. They are the output values for the elements of PxQ I listed, but when I evaluate these composite statements, I want to evaluate the output in the order I listed the elements of the input. So it's not exactly a set. Could I call it an ordered set of outputs?
The point I'm trying to make is that no matter how complicated or large a composite statement you make is that contains exactly 2 component statements, it's logically equivalent to exactly one of these 16 composite statements enter link description here
I differentiate these composite statements (or really functions), by these 'ordered sets'. The elements in a set can be arranged however one wants and not have an effect on the set, however the placement of the elements in these is attempting to show which element of PxQ they are related to.
Also I think it's interesting that if you look at any of these types of logical connectives( implication, disjunction, conjuction, negation) you can disregard their philosophical or language meaning and considered them to just be a function that maps the elements in PxQ to a specific ordered set. Combining the various logical connectives can allow you to create different functions. But if I picked or made 3 or 4 different logical connectives, which were some of these other functions, could I create the rest of the 16 functions that are logically equivalent to all composite statements that have exactly 2 component statements?
Also it seems that composite statements with n components have 2^n elements in the input and output, and that there are 2^(2^(n)) composite statements which all composite statements with n component statements are logically equivalent to exactly one of?