Validity Using Euler Circles and Truth Tables

[kma27]

I'm so confused on how to tackle this problem:



1. Truth tables are related to Euler circles. Arguments in the form of Euler circles can be translated into statements using the basic connectives and the negation as follows:



Let p be “The object belongs to set A. “Let q be “the object belongs to set B.”


All A is B is equivalent to p -> q.

No A is B is equivalent to p ->~ q.

Some A is B is equivalent to p ^ q.

Some A is not B is equivalent to p ^ ~q.


Determine the validity of the next arguments by using Euler circles, then translate the statements into logical statements using the basic connectives, and using truth tables, determine the validity of the arguments. Compare your answers.


(a). No A is B.
Some C is A.
___________
Therefore Some C is not B.


(b) All B is A.
All C is A.
__________
Therefore All C is B.

 

[HallsofIvy]

?? What do you want help with? What have you done on (a) and (b)?

 

[ladycherry196]

I am having the same problem with that same problem.

 

[glendareese]

this question has me stumped also. I do not know the first step to getting started. any help will be greatly appreciated. thanks