tablas de verdad

1)

p	^	q	^	¬	r	v	¬q	^	¬p	→	r
1	1	1	0	0	1	1	0	0	0	1	1
1	1	1	1	1	0	0	0	1	0	1	0
1	0	0	0	0	1	1	1	0	0	1	1
1	0	0	0	0	0	1	1	0	0	1	0
0	0	1	0	0	1	1	0	0	1	1	1
0	0	1	0	1	0	0	0	0	1	0	0
0	0	0	0	0	1	1	1	0	1	1	1
0	0	0	0	0	0	1	1	0	1	0	0

es satisfactible.
2)

p	r	P →(p v q)	P v q	P → q	(p v q) ^  (p →q)	P v ¬q	(p → q) →(p ^ q)	P ↔ q	(p ^ q)	(p → q) → ¬p	[( p → q) →¬p] ^ ( p v q)	[(p→ q) → (p ^ q) ]→ ¬p	(¬p ^ q)	(p v q) → ¬q	(p v ¬q )  (p ↔ q)	¬p ^ ¬q	(p ^ q) ^ [(p → q)→ ¬p]
1	1	1	1	1	1	1	1	1	1	0	0	0	0	0	0	0	0
0	1	1	1	1	1	0	0	0	0	1	1	1	1	0	0	0	0
1	0	1	1	0	0	1	1	0	0	1	1	0	0	1	1	0	0
0	0	1	0	1	0	1	0	1	0	1	0	1	0	1	0	1	0