Diagramming Quantified Logic (Combining "All" and"Most" Statements)

cgemma

When combining an "all" statement that shares its sufficient condition with the necessary condition of a "most" statement, how do you determine the sufficient/necessary order between the new terms? It's my understanding that this combination of statements would result in a valid "most" statement, but I don't understand which condition becomes sufficient and which becomes necessary.

For instance, if:
A --> B
C (most) -- A

Would the accurate conclusion be C (most) -- B, or B (most) -- C?

canihazJD

C most B. You dont know how many non-C B's there are

cgemma

@canihazJD Thank you!