Proof of validity

Arrangements, sorting, packing, partitions, critical path analysis, networks, graphs, ...
Post Reply
MARKOPALO
Posts: 1
Joined: Thu Nov 19, 2015 3:46 pm

Proof of validity

Post by MARKOPALO » Thu Nov 19, 2015 3:53 pm

Can someone give me the solution?
thanks :)

-> = implies
^ = conjunction
v = disjunction
~ = not (negation)

1. m -> n
2. m v (o^p)
3. ~n^~q/ o

1. (a -> b) ^ (c -> d)
2. e -> f
3. (a v e) ^ (c v d)/ b v f

1. (~m v ~n) -> (o -> n)
2. m -> m
3. ~m/ ~o -> ~n

1. (k v l) -> (m v n)
2. (m v n) -> (o v p)
3. k/ o v ~p

zmoltion
Posts: 1
Joined: Mon Jan 04, 2016 9:04 pm

Re: Proof of validity

Post by zmoltion » Sat Jan 09, 2016 3:48 am

I haven't worked through these, but what are we offering solutions to? What is the question we're to answer?
Image

Post Reply