LISTA 1
JOHNATTAN CHIN
23/04/2015
LISTA 1
1) a) ( p V ( ¬( q -> ( r -> ( ¬r ) ) ) ) ); base: p, q, r são fórmulas. passo : ¬r, r -> (¬r), q -> ( r -> (¬r) ), ¬(q -> (r -> (¬r) ) ) e ( p V ( ¬( q -> ( r -> ( ¬r ) ) ) ) ) são fórmulas. b) ( ( ¬( ¬p ) ) V ( ¬q ) ); base: p, q são fórmulas. passo : ¬p, ( ¬( ¬p) ), (¬q) e ( ( ¬( ¬p ) ) V ( ¬q ) ) são fórmulas.
c) ( ( p V q ) -> ( r Ʌ p ( ¬( ¬r) ) ) ) base: p, q, r são fórmulas. passo : ¬r e ¬( ¬r) são fórmulas. p ( ¬ ( ¬r) não é possível de ser formada pois não há um conectivo binário para ligar p e r.
2) a) ( p -> ( q -> ( p Ʌ q) ) ) p -> q -> p Ʌ q.
b) ( ¬( p V ( p Ʌ q) ) )
¬ (p V p Ʌ q).
c) ( ¬( p Ʌ ( p V q) ) )
¬ (p Ʌ (p V q))
d) (( p V ( p -> q )) -> q) p V ( p -> q) -> q.
3) a) ¬p -> q
( ( ¬p) -> q).
b) p -> q -> r -> p Ʌ q Ʌ r
( p -> ( q -> ( r -> ( p Ʌ ( q Ʌ r) ) ) ) ).
c) p Ʌ ¬ q V r Ʌ s ( ( p Ʌ ( ¬ q) ) V ( r Ʌ s) ) .
d) p Ʌ ¬ ( p -> ¬q) V ¬q
( (p Ʌ ¬ ( p -> ( ¬q) ) ) V ( ¬q) ).
4) a) ¬p -> q
Subf (¬p -> q) =
{¬p -> q} U Subf(¬p) U Subf(q) =
{¬p -> q} U {¬p} U Subf(p) U {q} =
{¬p -> q} U {¬p} U {p} U {q} =
{ p, q, ¬p, ¬p -> q}.
b) p -> q -> r -> p Ʌ q Ʌ r
Subf(p -> q -> r -> p Ʌ q Ʌ r) =
{p -> q -> r -> p Ʌ q Ʌ r} U Subf(p) U Subf( q -> r -> p Ʌ q Ʌ r) =
{p -> q -> r -> p Ʌ q Ʌ r} U {p} U { q -> r -> p Ʌ q Ʌ r} U Subf(q) U Subf( r -> p Ʌ q Ʌ r) =
{p -> q -> r -> p Ʌ q Ʌ r} U {p} U { q -> r -> p Ʌ q Ʌ r} U {q} U { r -> p Ʌ q Ʌ r} U Subf(r) U Subf(p Ʌ q Ʌ r) =
{p -> q -> r -> p Ʌ q Ʌ r} U {p} U { q -> r -> p Ʌ q Ʌ r} U {q} U { r -> p Ʌ q Ʌ r} U {r} U { p Ʌ q Ʌ r } U Subf(pɅq) U Subf(r) =
{ p -> q -> r -> p Ʌ q Ʌ r} U {p} U { q -> r -> p Ʌ q Ʌ r} U {q} U { r -> p Ʌ q Ʌ r} U {r} U { p Ʌ q Ʌ r } U {p Ʌ q} U Subf(p) U Subf(q) U {r} =
{ p -> q -> r -> p Ʌ q Ʌ r} U {p} U { q -> r -> p Ʌ q Ʌ r} U {q} U { r -> p Ʌ q Ʌ r} U {r} U { p Ʌ q Ʌ r } U {p Ʌ q} U {p} U {q} U {r} =
{p, q, r, p Ʌ q, p Ʌ q Ʌ r, r -> p Ʌ q Ʌ r, q -> r -> p Ʌ q Ʌ r, p -> q -> r -> p Ʌ q Ʌ r}.