3 comments

  • Tuesday, Sep 25 2018

    No, you cannot infer that from the first example.

    Let's say there are 2 As that exist. So we know, all those As are Bs. But what if there are 50 Bs in total? So those 2 As are only a small amount. Then, even if most Bs are Cs, those 2 Bs that are also As could be part of the "most" that are Cs or not. It's unknown.

    3
  • Monday, Sep 24 2018

    @akikookmt881 Yes that's what I meant. Sorry if I confused you.

    I just know that

    A → B

    B →m→ C

    cannot be A → m → C

    A → B

    B →some→ C

    cannot be A → s → C

    I want to know if you can get A → s → C from first diagram

    0
  • Monday, Sep 24 2018

    @akikookmt881 said:

    Can you solve this below?

    A - B

    Most B - C

    A- B

    Some B - C

    Hey @akikookmt881,

    Sorry, I can't really understand what you are writing.

    Were you meaning to write as below?

    A → B

    B -m→ C

    A → B

    B ←some→ C

    And what would you like to "solve" from this?

    0

Confirm action

Are you sure?