Untitled

Tópicos de Matemática Discreta
2o semestre do ano letivo 2021/2022 — MIEGSI, Departamento de Matemática, Universidade do Minho

Ficha 1 — 28 de março de 2022
Nome completo: Número de aluno: v1
A ficha tem 10 questões de resposta múltipla. Deve enviar e-mail ao docente com com as respostas num ficheiro de texto (.txt) .
Nota: Deve enviar e-mail ao docente até dia 1 de Abril às 23:59 da sua conta de e-mail institucional.
O nome do ficheiro deverá ser numeroaluno-versaoficha.txt, por exemplo a999999v122.txt
Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

cruz na tabela ao lado qual das quatro proposições é verdadeira (existe A
apenas uma por questão). Cotações — resposta certa: 2; nenhuma B
ou mais do que uma proposição selecionadas: 0; resposta errada: C
−0.35. D
I.1 Considere o seguinte argumento: “R é uma condição necessária para Q. Verifica-se P ou a negação de R.
Logo, se Q for verdade, não se verifica P .” A sua tradução em linguagem do Cálculo Proposicional pode ser:
A . Nenhuma das outras opções.
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
I.2 Considere as fórmulas π : (p ∧ (q ∨ r )) → (p ∧ q) e

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . Ω é uma tautologia e π é uma tautologia.
B . Ω é uma tautologia e π não é uma tautologia.
C . Ω é uma contradição e π é uma tautologia.
D . Nenhuma das outras opções.
n
I.3 Pretende-se provar que ∀n ∈ N, [ ni=1 (3i ) = 3 1−3
P
1−3 ] usando o princípio de indução em N.
Qual das seguintes proposições é verdadeira?
k
A . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (3i ) = 3 1−3
P
1−3 é proposição
k+1
verdadeira e verificar que k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
B . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (3i ) = 3 1−3
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
C . Nenhuma das outras opções.
Pk k
D . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : i=1 (3
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
I.4 Sabendo que x → y é uma proposição falsa, considere as seguintes proposições:
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . (a) ou (c), mas não ambas, são verdadeiras.
B . Nenhuma das outras opções.
C . (c) ou (d) são verdadeiras.
D . (a) e (b) são verdadeiras.
I.5 Considere as proposições: p: “São 4 e meia da tarde.” q: “O Benfica é campeão.” r: “O céu é cor de laranja.”
A tradução em linguagem simbólica “Ou são 4 e meia da tarde ou o Benfica é campeão, se o céu é cor de laranja” é:
A . r → (p ⊕ q).
C . r → (p ∨ q).
D . (p ⊕ q) → r .
I.6 Indique quais dos seguintes argumentos é válido:
B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .
I.7 Considere as seguintes fórmulas proposicionais: ϕ : p → (p ∨ q) e ψ : (q ∧ p) → r . Então:

A . A negação de ψ é logicamente equivalente a q ∧ p ∧ ¬r .
B . A negação de ϕ é logicamente equivalente a ¬(p ∨ q) → ¬p.
D . A negação de ϕ é logicamente equivalente a q ∧ ¬p.
I.8 A proposição P : ((¬p ∨ ¬q) ∧ q) → ¬p é logicamente equivalente a:

A . >.
C . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.
I.9 No universo do discurso “pessoas”, considere a função proposicional B(x, y ): “y é amigo de x”.
A proposição “Toda a gente tem um amigo.” pode ser escrita como:
A . ∃x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
I.10 Mostrar que ∀x ∈ W, [a(x) ↔ b(x)], é o mesmo que mostrar,

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
C . ∃x ∈ W, [¬(a(x) → b(x))].
Fim.

−0.35. D

A . A negação de ϕ é logicamente equivalente a ¬(p ∨ q) → ¬p.
B . A negação de ϕ é logicamente equivalente a q ∧ ¬p.
D . A negação de ψ é logicamente equivalente a q ∧ p ∧ ¬r .
I.2 Considere o seguinte argumento: “R é uma condição suficiente para Q. Verifica-se R ou a negação de P .
Logo, se Q não for verdade, não se verifica P .” A sua tradução em linguagem do Cálculo Proposicional pode ser:
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
I.3 Considere as seguintes proposições: P1 : p → p, P2 : p∧ ⊥ e P3 : p ⊕ ¬p. Então:

A . P1 é uma tautologia e P3 uma contradição.
B . P1 e P3 são tautologias.
D . P1 e P2 são contradições.
I.4 Pretende-se provar que ∀n ∈ N, [ ni=1 (5i ) = (5 + 5n) n2 ] usando o princípio de indução em N.
P

A . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (5i ) = (5 + 5k) k2 é proposição
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
B . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (5i ) = (5 + 5k) k2 é proposição
P
Pk+1 Pk 2
verdadeira e verificar que i=1 (5i ) = i=1 (5i ) + 5k + 5 = 5k +15k+102 .
Pk
D . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : i=1 (5i ) = (5 + 5k) k2 é proposição
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
I.6 Considere as proposições: P: “O Sol é côr de laranja.” Q: “O cão tem 4 patas.” R: “O telemóvel é caro.”
A tradução em linguagem simbólica “Se o sol é côr de laranja e o cão não tem 4 patas, então o telemóvel é caro.” é:
B . P ∧ ¬Q ∧ R.
C . P ∧ ¬Q → R.
D . P ∧ (¬Q → R).
I.7 Mostrar que ∀x ∈ U, [a(x) → b(x)], é o mesmo que mostrar,
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
B . (a) ou (c), mas não ambas, são verdadeiras.
I.9 A proposição P : (p ∧ q) → (p ∨ q) é logicamente equivalente a:

A . ⊥.
B . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
I.10 A proposição ∃x ∈ {a, b}∃y ∈ {1, 2}P (x, y ) é logicamente equivalente a:

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
Fim.

−0.35. D
I.1 Sabendo que p → q é uma proposição falsa, considere as seguintes proposições:
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
C . (a) e (b) são verdadeiras.
D . (c) ou (d) são verdadeiras.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
I.3 Mostrar que ∀x ∈ U, [q(x) ↔ p(x)], é o mesmo que mostrar,

A . ∃x ∈ U, [¬(q(x) → p(x))].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].

C . A negação de ϕ é logicamente equivalente a q ∧ ¬p.
D . A negação de ϕ é logicamente equivalente a ¬(p ∨ q) → ¬p.

A . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
I.6 Considere as seguintes expressões lógicas:
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.
Quais destas expressões lógicas são contradições?

A . Todas.
C . (a) e (d).
D . (a) e (b).
A . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
B . r → (p ⊕ q).
C . (p ⊕ q) → r .
D . r → (p ∨ q).
n−3
I.9 Pretende-se provar que ∀n ∈ N, [n ≥ 4 → ni=4 (2i ) = 16 1−2
P
1−2 ] usando o princípio de indução em N
com base n0 . Qual das seguintes proposições é verdadeira?
n−3
A . Provar a base de indução consiste em considerar P (n) : ni=1 (2i ) = 16 1−2
P
1−2 e
mostrar que P (1) é proposição verdadeira.
C . Provar o passo de indução consiste em considerar que por hipótese para k natural com k ≥ 4,
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
1−2 é proposição verdadeira e verificar que
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
D . Provar o passo de indução consiste em considerar que por hipótese para k natural com k ≥ 4,
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
Fim.

−0.35. D
I.1 Considere as proposições P1 : p → q e P2 : ¬(p → ¬q) ∨ (p → ¬q). Então:

B . P2 é uma tautologia.
C . P1 é uma contradição.
D . P1 é uma tautologia.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.

A . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
I.4 Sabendo que ¬(x ∨ y ) → z é uma proposição falsa, considere as seguintes proposições:
(a) : ¬x ∨ y . (b) : (x ∧ y ) ∨ z. (c) : y → x. (d) : (¬x ∨ y ) ↔ (x ∨ z).
Então:
A . Ou (a) ou (c), mas não ambas, são verdadeiras.
C . Se (c), então (b).
I.5 Qual das seguintes proposições é verdadeira:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= Q.
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
C . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (3i ) = 3 1−3
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
I.10 Sendo “pessoas” o universo do discurso, considere a função proposicional B(x, y ): “x é amigo de y ”.
A proposição: “Há alguém que é amigo de toda a gente” pode ser escrita como:
A . ∀x, ∃y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
Fim.

−0.35. D
A . ∀x, ∀y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
Quais destas expressões lógicas são tautologias?
A . (a) e (d).
B . Todas.
D . (a) e (b).
I.3 A proposição P : ¬(p ∨ (¬p ∧ q)) é logicamente equivalente a:

A . ⊥.
B . ¬p ∧ ¬q.
C . >.

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
I.7 Pretende-se provar que ∀n ∈ N, [n ≥ 2 → ni=2 (2i + 3) = (n + 5)(n − 1)] usando o princípio de indução em N
P

B . Provar o passo de indução consiste em considerar que por hipótese para k natural com k ≥ 2,
P (k) : ki=1 (2i + 3) = (k + 5)(k − 1) é proposição verdadeira e verificar que
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
C . Provar a base de indução consiste em considerar P (n) : ni=1 (2i + 3) = (n + 5)(n + 1) e
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
B . (a) e (b) são verdadeiras.
I.9 Considere as proposições: P: “O céu é vermelho.” Q: “O mar é azul” R: “Amanhã é sábado.”

A tradução em linguagem simbólica “Se o céu é vermelho, então o mar não é azul ou amanhã é sábado” é:
A . P → (¬Q ∨ R).
B . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.

B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].
Fim.

−0.35. D
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
C . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (5i ) = (5 + 5k) k2 é proposição
P
Pk+1 Pk
verdadeira e verificar que i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) k2 .
D . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (5i ) = (5 + 5k) k2 é proposição
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .

A . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
I.3 Mostrar que ∀x ∈ U, [s(x) → t(x)], é o mesmo que mostrar,

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

B . P1 é uma contradição.
C . P1 é uma tautologia.

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
A . {P ↔ Q, ¬Q} |= Q.
B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
I.9 Sabendo que ¬(p ∨ q) → r é uma proposição falsa, considere as seguintes proposições:
(a) : ¬p ∨ q. (b) : (p ∧ q) ∨ r. (c) : q → p. (d) : (¬p ∨ q) ↔ (p ∨ r ).
Então:
B . (c) ou (d) são verdadeiras.
C . Ou (a) ou (c), mas não ambas, são verdadeiras.
D . Se (c), então (b).
A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . A negação de ϕ é logicamente equivalente a q ∧ ¬p.
C . A negação de ϕ é logicamente equivalente a ¬(p ∨ q) → ¬p.
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
A . r → (p ⊕ q).
B . r → (p ∨ q).
C . (p ⊕ q) → r .
I.5 Mostrar que ∀x ∈ Y, [α1 (x) ∨ α2 (x) ∨ ... ∨ αn (x) → β(x)], é o mesmo que mostrar,
A . ∀x ∈ Y, [(α1 (x) → β(x)) ∧ (α2 (x) → β(x)) ∧ ... ∧ (αn (x) → β(x))].
B . ∀x ∈ Y, [(α1 (x) → β(x)) ∨ (α2 (x) → β(x)) ∨ ... ∨ (αn (x) → β(x))].
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= P .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . (a) e (b) são verdadeiras.
C . (a) ou (c), mas não ambas, são verdadeiras.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
B . (a) e (b).
D . (a) e (d).
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
C . >.
Fim.

−0.35. D
n−3
P
A . Provar o passo de indução consiste em considerar que por hipótese para k natural com k ≥ 4,
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
C . Provar a base de indução consiste em considerar P (n) : i
i=1 (2 ) = 16 1−2
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
B . (a) e (d).
C . Todas.

A . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
Então:
A . Se (c), então (b).
D . Ou (a) ou (c), mas não ambas, são verdadeiras.

B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).

A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
Fim.

−0.35. D
n
P
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
C . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : i=1 (3
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . (c) ou (d) são verdadeiras.

B . ¬(¬p ∧ q) ∧ ¬p.
C . >.
D . ⊥.

B . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬t(x) → ¬s(x)].
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . P ∧ ¬Q → R.
B . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
I.2 A proposição ∃x ∈ {1, 2}∀y ∈ {α, β}P (x, y ) é logicamente equivalente a:

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
A . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
n
P
k
P
Pk+1 i Pk k+1
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + (k + 1) = 3 1−31−3 .
k
P
Pk+1 i Pk k+1
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + 3k+1 = 3 1−3
1−3 .
k
P
Pk+1 i Pk k
1−3 .

A . {P ↔ Q, ¬Q} |= Q.
B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
D . (a) ou (c), mas não ambas, são verdadeiras.

A . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
B . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].

A . ¬p ∧ ¬q.
B . >.
D . ⊥.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
C . Todas.
D . (a) e (b).

B . A negação de ψ é logicamente equivalente a q ∧ p ∧ ¬r .
Fim.

−0.35. D

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .


A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
C . >.

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
B . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Então:
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
D . Provar a base de indução consiste em considerar P (n) : ni=1 (2i + 3) = (n + 5)(n + 1) e
P
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.
Fim.

−0.35. D

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . Ω é uma contradição e π é uma tautologia.
C . Ω é uma tautologia e π não é uma tautologia.
D . Ω é uma tautologia e π é uma tautologia.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
C . ∀x ∈ Y, [(α1 (x) → β(x)) ∧ (α2 (x) → β(x)) ∧ ... ∧ (αn (x) → β(x))].
A . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
Fim.

−0.35. D
n
P
k
P
Pk+1 i Pk k
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
k
D . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : ki=1 (3i ) = 3 1−3
P
Pk+1 i Pk k+1
A . ∀x, ∀y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
A . P ∧ ¬Q → R.
B . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).

A . >.
B . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].
A . P1 é uma tautologia.

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . ¬p ∧ ¬q.
C . >.
D . ⊥.
n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
A . r → (p ⊕ q).
B . r → (p ∨ q).
C . (p ⊕ q) → r .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . (a) e (b).
D . Todas.
I.9 Mostrar que ∀x ∈ W, [q1 (x) ∨ q2 (x) ∨ ... ∨ qn (x) → p(x)], é o mesmo que mostrar,
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
C . ∀x ∈ W, [(q1 (x) → p(x)) ∧ (q2 (x) → p(x)) ∧ ... ∧ (qn (x) → p(x))].
D . ∀x ∈ W, [(q1 (x) → p(x)) ∨ (q2 (x) → p(x)) ∨ ... ∨ (qn (x) → p(x))].

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.
Fim.

−0.35. D
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

P
com base n0 . Qual das seguintes proposições é verdadeira? P

A . Provar a base de indução consiste em considerar P (n) : ni=1 (2i + 3) = (n + 5)(n + 1) e
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . ∀x ∈ Y, [(α1 (x) → β(x)) ∨ (α2 (x) → β(x)) ∨ ... ∨ (αn (x) → β(x))].
B . ∀x ∈ Y, [(α1 (x) → β(x)) ∧ (α2 (x) → β(x)) ∧ ... ∧ (αn (x) → β(x))].
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
B . (a) e (d).
D . (a) e (b).
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

A . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.

A . >.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ⊥.
A . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q ∧ R.
Fim.

−0.35. D
A . P ∧ ¬Q → R.
B . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . >.
D . ⊥.

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . Ω é uma tautologia e π não é uma tautologia.
C . Ω é uma tautologia e π é uma tautologia.
D . Ω é uma contradição e π é uma tautologia.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

B . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].
P

P
Pk+1 Pk 2
verdadeira e verificar que i=1 (5i ) = i=1 (5i ) + k + 1 = 5k +15k+10
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D

A . P → (¬Q ∨ R).
B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.

B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
P
Pk+1 Pk 2
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . >.
B . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
A . ∀x, ∃y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
C . (a) e (d).
D . Todas.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D

B . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .

A . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬a(x) → ¬b(x)].

n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
D . Provar a base de indução consiste em considerar P (n) : i
i=1 (2 ) = 16 1−2
1−2 e
A . r → (p ⊕ q).
B . r → (p ∨ q).
D . (p ⊕ q) → r .
Então:
B . Ou (a) ou (c), mas não ambas, são verdadeiras.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∀x, ∀y [B(x, y )].

B . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.
D . >.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . Todas.
C . (a) e (d).
D . (a) e (b).
Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . ⊥.
C . >.
D . ¬p ∧ ¬q.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . Todas.
C . (a) e (b).
D . (a) e (d).
A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.
A . ∃x, ∀y [B(x, y )].
B . ∃x, ∃y [B(x, y )].
C . ∀x, ∃y [B(x, y )].

A . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.

B . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬a(x) → ¬b(x)].
Fim.

−0.35. D
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
B . ∃x ∈ W, [¬(a(x) → b(x))].
C . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
A . ⊥.
B . ¬(¬p ∧ q) ∧ ¬p.
C . >.
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
D . Provar a base de indução consiste em considerar P (n) : ni=1 (2i ) = 16 1−2
P
1−2 e
A . P ∧ (¬Q → R).
B . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
B . Ω é uma contradição e π é uma tautologia.
Fim.

−0.35. D


A . >.
B . ⊥.
C . ¬p ∧ ¬q.
n−3
P
n−3
B . Provar a base de indução consiste em considerar P (n) : ni=1 (2i ) = 16 1−2
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∃x, ∃y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . r → (p ∨ q).
B . r → (p ⊕ q).
C . (p ⊕ q) → r .

A . {P ↔ Q, ¬Q} |= Q.
B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].


A . ⊥.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.

B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .

P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
D . Provar a base de indução consiste em considerar P (n) : i=1 (2i + 3) = (n + 5)(n + 1) e
Fim.

−0.35. D
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
C . ∀x ∈ Y, [(α1 (x) → β(x)) ∨ (α2 (x) → β(x)) ∨ ... ∨ (αn (x) → β(x))].
D . ∀x ∈ Y, [(α1 (x) → β(x)) ∧ (α2 (x) → β(x)) ∧ ... ∧ (αn (x) → β(x))].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
n
P
k
P
Pk+1 i Pk k
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k+1

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= ¬P .

B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

A . ⊥.
C . >.
D . ¬p ∧ ¬q.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . Todas.
D . (a) e (b).
Fim.

−0.35. D
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

D . P1 é uma contradição.

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.
A . P ∧ ¬Q → R.
B . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).

B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ⊥.
D . >.
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].

C . A negação de ψ é logicamente equivalente a q ∧ p ∧ ¬r .
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
Então:
n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
B . ∀x ∈ W, [(q1 (x) → p(x)) ∨ (q2 (x) → p(x)) ∨ ... ∨ (qn (x) → p(x))].

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
D . Ω é uma tautologia e π não é uma tautologia.

A . >.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ⊥.

A . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
D . (P → ¬Q) ∨ R.
Fim.

−0.35. D

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
C . >.
A . r → (p ∨ q).
B . (p ⊕ q) → r .
D . r → (p ⊕ q).

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . Todas.
D . (a) e (b).
A . ∃x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
Então:
B . Se (c), então (b).


A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
P
Pk+1 Pk 2
Fim.

−0.35. D

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
P

B . Provar a base de indução consiste em considerar P (n) : ni=1 (2i + 3) = (n + 5)(n + 1) e
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
A . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.

A . ⊥.
C . >.
D . ¬(¬p ∧ q) ∧ ¬p.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D
Então:
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
C . ∀x ∈ W, [(q1 (x) → p(x)) ∨ (q2 (x) → p(x)) ∨ ... ∨ (qn (x) → p(x))].
D . ∀x ∈ W, [(q1 (x) → p(x)) ∧ (q2 (x) → p(x)) ∧ ... ∧ (qn (x) → p(x))].
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . r → (p ⊕ q).
B . (p ⊕ q) → r .
C . r → (p ∨ q).
A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= ¬Q.

A . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
C . Provar a base de indução consiste em considerar P (n) : i=1 (2i + 3) = (n + 5)(n + 1) e
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
Fim.

−0.35. D
Então:
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .

B . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . P1 é uma contradição.

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).

A . ⊥.
C . >.
D . ¬p ∧ ¬q.
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
Fim.

−0.35. D

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬t(x) → ¬s(x)].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . >.
B . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
n
P
k
P
Pk+1 i Pk k+1
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + (k + 1) = 3 1−3
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
A . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q ∧ R.

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.
Fim.

−0.35. D

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . ⊥.
C . >.

Fim.

−0.35. D
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
Então:
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
D . ∀x ∈ Y, [(α1 (x) → β(x)) ∨ (α2 (x) → β(x)) ∨ ... ∨ (αn (x) → β(x))].
A . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.

A . ⊥.
B . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).

Fim.

−0.35. D

B . ∀x ∈ U, [¬s(x) → ¬t(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
D . ∀x ∈ U, [¬t(x) → ¬s(x)].

n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . >.
B . ⊥.
D . ¬p ∧ ¬q.
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
B . (p ⊕ q) → r .
C . r → (p ⊕ q).
D . r → (p ∨ q).
A . ∀x, ∃y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
Fim.

−0.35. D

B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
B . ∀x ∈ W, [(q1 (x) → p(x)) ∧ (q2 (x) → p(x)) ∧ ... ∧ (qn (x) → p(x))].

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P
Pk+1 Pk
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

A . ¬p ∧ ¬q.
C . >.
D . ⊥.

B . P1 e P2 são contradições.
C . P1 é uma tautologia e P3 uma contradição.
D . P1 e P3 são tautologias.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . (p ⊕ q) → r .
C . r → (p ⊕ q).
D . r → (p ∨ q).
Fim.

−0.35. D

A . P1 e P3 são tautologias.
A . P ∧ ¬Q → R.
B . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
D . >.

A . ∀x ∈ W, [(q1 (x) → p(x)) ∨ (q2 (x) → p(x)) ∨ ... ∨ (qn (x) → p(x))].
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Então:

B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= ¬P .
Fim.

−0.35. D
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . (a) e (b).
C . Todas.

A . ¬p ∧ ¬q.
B . >.
C . ⊥.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.

P

P
Pk+1 Pk 2
2 .
Pk
C . Provar o passo de indução consiste em considerar como hipótese de indução P (k) : i=1 (5i ) = (5 + 5k) k2 é proposição
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .

B . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].
A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
Fim.

−0.35. D

B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .

A . ∃x ∈ W, [¬(a(x) → b(x))].
B . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
D . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].


A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
A . P ∧ ¬Q → R.
C . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
C . ⊥.
Fim.

−0.35. D

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

A . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.
D . >.
A . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
Então:

A . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .

A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .

P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
A . ∃x, ∃y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . P → (¬Q ∨ R).
B . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.
A . >.
B . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.

C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
Fim.

−0.35. D
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . Todas.
D . (a) e (b).

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . r → (p ⊕ q).
B . r → (p ∨ q).
D . (p ⊕ q) → r .
Então:

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . ⊥.
D . >.
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
Fim.

−0.35. D

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
A . ⊥.
B . ¬(¬p ∧ q) ∧ ¬p.
D . >.

A . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
C . Todas.
D . (a) e (d).

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
Fim.

−0.35. D
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . r → (p ∨ q).
B . r → (p ⊕ q).
C . (p ⊕ q) → r .
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .

A . ⊥.
B . >.
D . ¬(¬p ∧ q) ∧ ¬p.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . Todas.
D . (a) e (b).
Fim.

−0.35. D

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= ¬P .
A . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
A . r → (p ∨ q).
B . (p ⊕ q) → r .
D . r → (p ⊕ q).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . (a) e (b).
D . Todas.
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . >.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
Fim.

−0.35. D

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . ⊥.
D . >.
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
C . r → (p ∨ q).
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
P
Pk+1 Pk
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Então:

B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

B . P1 é uma tautologia e P3 uma contradição.
C . P1 e P3 são tautologias.

B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∃x ∈ W, [¬(a(x) → b(x))].
D . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
Fim.

−0.35. D

Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
n
P
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).

B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .

B . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
Então:

B . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . Todas.
D . (a) e (b).
Fim.

−0.35. D

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬t(x) → ¬s(x)].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
A . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).

A . ⊥.
B . ¬p ∧ ¬q.
D . >.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
B . (a) e (d).
C . Todas.
Fim.

−0.35. D

A . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
P

P
Pk+1 Pk
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
A . ⊥.
C . ¬p ∧ ¬q.
D . >.

A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.

C . P1 e P2 são contradições.
Então:
Fim.

−0.35. D

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . ⊥.
C . >.

B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).

A . P1 e P2 são contradições.
D . P1 é uma tautologia e P3 uma contradição.
Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.

B . ⊥.
C . ¬p ∧ ¬q.
D . >.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
C . Todas.
D . (a) e (b).
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
Pk+1 i Pk k+1
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + 3k+1 = 3 1−3 1−3 .
A . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q ∧ R.

A . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬t(x) → ¬s(x)].
Fim.

−0.35. D

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).

A . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
Então:

B . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . (a) e (b).
D . Todas.
Fim.

−0.35. D
A . (p ⊕ q) → r .
B . r → (p ∨ q).
D . r → (p ⊕ q).
B . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . ⊥.
B . >.
D . ¬p ∧ ¬q.
Então:

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.
P

P
Pk+1 Pk 2
verdadeira e verificar que i=1 (5i ) = i=1 (5i ) + 5k + 5 = 5k +15k+10
2 .
P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .


A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
Fim.

−0.35. D

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .
Então:

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

B . (a) e (b).
C . Todas.
D . (a) e (d).
A . >.
C . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . P → (¬Q ∨ R).
B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
Fim.

−0.35. D
B . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.

A . ¬p ∧ ¬q.
B . ⊥.
C . >.

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Fim.

−0.35. D
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
C . Todas.
D . (a) e (d).
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .

Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . >.
C . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
Então:

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
Fim.

−0.35. D
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].

A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].
P

P
Pk+1 Pk 2
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:


A . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .

B . >.
C . ⊥.
D . ¬p ∧ ¬q.
B . (p ⊕ q) → r .
C . r → (p ⊕ q).
D . r → (p ∨ q).
Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . (P → ¬Q) ∨ R.
B . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
C . >.
A . ∀x, ∃y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
Fim.

−0.35. D
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ¬p ∧ ¬q.
B . ⊥.
D . >.

A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
Então:
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
B . (p ⊕ q) → r .
C . r → (p ∨ q).
D . r → (p ⊕ q).
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

B . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
D . (P → ¬Q) ∨ R.
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∀x, ∀y [B(x, y )].
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= Q.

B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . Todas.
C . (a) e (b).
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Fim.

−0.35. D

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
Então:

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.

B . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
D . (P → ¬Q) ∨ R.

A . ⊥.
B . ¬(¬p ∧ q) ∧ ¬p.
C . >.
Fim.

−0.35. D

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
C . (a) e (d).
D . (a) e (b).
Então:

B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . r → (p ⊕ q).
C . (p ⊕ q) → r .
D . r → (p ∨ q).

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (p ⊕ q) → r .
C . r → (p ⊕ q).
D . r → (p ∨ q).

A . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

B . >.
C . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.


Fim.

−0.35. D
Então:

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
B . (a) e (d).
C . Todas.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.

A . ¬p ∧ ¬q.
C . ⊥.
D . >.
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
Fim.

−0.35. D

A . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.

A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

A . ∃x ∈ W, [¬(a(x) → b(x))].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].

B . ∀x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
Fim.

−0.35. D
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
P

P
Pk+1 Pk 2
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . >.
D . ⊥.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
B . Todas.
C . (a) e (d).
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
Fim.

−0.35. D
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .


A . >.
B . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
A . ∀x ∈ W, [(q1 (x) → p(x)) ∧ (q2 (x) → p(x)) ∧ ... ∧ (qn (x) → p(x))].
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= ¬P .
D . {P, P → Q} |= P .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

Fim.

−0.35. D

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . r → (p ∨ q).
B . r → (p ⊕ q).
C . (p ⊕ q) → r .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

A . >.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (b).
C . (a) e (d).
D . Todas.

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .
Fim.

−0.35. D
A . ∃x, ∃y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
D . (P → ¬Q) ∨ R.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.

A . ⊥.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

Fim.

−0.35. D
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .


B . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
Fim.

−0.35. D
n
P
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k
1−3 .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
C . (a) e (b).
D . Todas.

A . ⊥.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
B . (p ⊕ q) → r .
C . r → (p ∨ q).
D . r → (p ⊕ q).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . P ∧ (¬Q → R).
B . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

Então:

B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.

B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
D . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .


A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= P .
Fim.

−0.35. D

A . ⊥.
B . ¬(¬p ∧ q) ∧ ¬p.
D . >.

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
B . (a) e (b).
C . (a) e (d).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
Fim.

−0.35. D

A . >.
B . ¬p ∧ ¬q.
D . ⊥.
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∀x, ∀y [B(x, y )].
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Então:
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
C . Todas.
D . (a) e (d).
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).
Fim.

−0.35. D

Então:
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
D . r → (p ∨ q).

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= ¬P .
D . {P, P → Q} |= P .


A . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬a(x) → ¬b(x)].
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.
Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
C . ⊥.

B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.

A . P → (¬Q ∨ R).
B . (¬Q → P ) ∨ R.
D . (P → ¬Q) ∨ R.
Fim.

−0.35. D

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
C . r → (p ∨ q).

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
Fim.

−0.35. D

A . ¬p ∧ ¬q.
B . >.
C . ⊥.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . ∃x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
Então:
P

P
Pk+1 Pk 2
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
B . Ω é uma tautologia e π é uma tautologia.

B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.

A . ⊥.
B . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
Fim.

−0.35. D

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .


A . ¬p ∧ ¬q.
C . >.
D . ⊥.
Então:
A . P ∧ (¬Q → R).
B . P ∧ ¬Q ∧ R.
C . P ∧ ¬Q → R.
A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].
P

P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

B . ∀x, ∃y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
A . (p ⊕ q) → r .
B . r → (p ⊕ q).
C . r → (p ∨ q).

A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.

A . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .

P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D

B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).


A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].
A . (p ⊕ q) → r .
B . r → (p ∨ q).
D . r → (p ⊕ q).
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

B . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (b).
C . Todas.
D . (a) e (d).

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
Fim.

−0.35. D


B . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .

B . (¬Q → P ) ∨ R.
C . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
B . ∀x ∈ U, [¬s(x) → ¬t(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D

A . ⊥.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
Então:
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . Todas.
D . (a) e (b).

B . (¬Q → P ) ∨ R.
C . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
Fim.

−0.35. D

A . >.
B . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

A . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) → ¬b(x)].
A . ∃x, ∃y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
n
P
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
A . P ∧ (¬Q → R).
B . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
Fim.

−0.35. D
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . ¬p ∧ ¬q.
B . ⊥.
D . >.

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .

P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
A . P ∧ ¬Q ∧ R.
B . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
B . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
C . (a) e (b).
D . (a) e (d).
Fim.

−0.35. D
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).

A . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.
D . >.
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
C . Todas.
D . (a) e (d).
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .
Então:
Fim.

−0.35. D
A . P ∧ ¬Q → R.
B . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
B . Todas.
D . (a) e (d).
A . >.
B . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

Fim.

−0.35. D

A . >.
B . ⊥.
D . ¬p ∧ ¬q.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
D . r → (p ∨ q).
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).

A . {P ↔ Q, ¬Q} |= Q.
B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . >.
B . ¬p ∧ ¬q.
D . ⊥.
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.
n
P
k
P
Pk+1 i Pk k
1−3 .
Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Fim.

−0.35. D
B . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
P

P
Pk+1 Pk 2
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
2 .

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .

B . >.
C . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Então:

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
B . (a) e (d).
D . Todas.
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D
Então:

A . >.
B . ¬p ∧ ¬q.
D . ⊥.

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
B . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
C . Todas.
D . (a) e (d).


A . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).
Fim.

−0.35. D
B . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].

A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
C . Provar a base de indução consiste em considerar P (n) : ni=1 (2i ) = 16 1−2
P
1−2 e
A . P ∧ ¬Q ∧ R.
B . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬p ∧ ¬q.
B . >.
D . ⊥.

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
Fim.

−0.35. D

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .


A . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
A . (p ⊕ q) → r .
B . r → (p ∨ q).
C . r → (p ⊕ q).


B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
P

P
Pk+1 Pk
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . ⊥.
B . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
Fim.

−0.35. D

A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].

A . (P → ¬Q) ∨ R.
B . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.
Então:

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
A . >.
C . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (d).
C . Todas.
D . (a) e (b).

Fim.

−0.35. D

A . P → (¬Q ∨ R).
B . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . Todas.
C . (a) e (b).

B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.
A . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
2 .
P
Pk+1 Pk 2
2 .
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D


A . ∃x ∈ U, [¬(q(x) → p(x))].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . >.
B . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= ¬P .
B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).

Então:
A . ∀x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
Fim.

−0.35. D
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk 2
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

B . ∃x ∈ W, [¬(a(x) → b(x))].
C . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
D . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= ¬P .

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).


A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
Fim.

−0.35. D
Então:

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
A . (p ⊕ q) → r .
B . r → (p ⊕ q).
D . r → (p ∨ q).


A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

B . ¬p ∧ ¬q.
C . >.
D . ⊥.

A . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .
Fim.

−0.35. D


A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].

A . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).
D . (¬Q → P ) ∨ R.

A . ∃x, ∀y [B(x, y )].
B . ∃x, ∃y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
B . ¬(¬p ∧ q) ∧ ¬p.
C . >.
D . ⊥.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
Fim.

−0.35. D
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . ¬p ∧ ¬q.
C . ⊥.
D . >.

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn


B . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).


A . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
Fim.

−0.35. D

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

B . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.

A . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.

B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
Então:
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
C . Todas.
D . (a) e (b).
A . r → (p ⊕ q).
C . (p ⊕ q) → r .
D . r → (p ∨ q).
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P
Pk+1 Pk 2
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Fim.

−0.35. D
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e

A . ⊥.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
Então:

A . ∀x, ∃y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].

A . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
D . r → (p ∨ q).

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
Fim.

−0.35. D
A . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e


A . ⊥.
B . ¬p ∧ ¬q.
C . >.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].
A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . Todas.
C . (a) e (b).

B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
Fim.

−0.35. D

A . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.
D . >.
Então:
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . ∃x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
A . (p ⊕ q) → r .
B . r → (p ∨ q).
D . r → (p ⊕ q).
A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬t(x) → ¬s(x)].
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
Pk+1 i Pk k+1
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + (k + 1) = 3 1−3 1−3 .

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
B . (a) e (b).
C . (a) e (d).
Fim.

−0.35. D

A . ⊥.
C . ¬p ∧ ¬q.
D . >.

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
B . (a) e (d).
D . Todas.
A . P ∧ ¬Q → R.
C . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).

B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
Fim.

−0.35. D
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
C . (a) e (d).
D . Todas.

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . ⊥.
B . ¬(¬p ∧ q) ∧ ¬p.
D . >.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

B . ∀x, ∃y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
Fim.

−0.35. D

A . >.
C . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . (p ⊕ q) → r .
B . r → (p ⊕ q).
D . r → (p ∨ q).
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
Então:
Fim.

−0.35. D
Então:

A . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
B . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
P

P
Pk+1 Pk 2
2 .
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
A . ¬p ∧ ¬q.
B . ⊥.
D . >.

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
A . r → (p ⊕ q).
C . (p ⊕ q) → r .
D . r → (p ∨ q).

Fim.

−0.35. D

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Então:
B . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].


A . ⊥.
C . >.
D . ¬p ∧ ¬q.

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
Fim.

−0.35. D
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].


A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.


A . >.
B . ¬p ∧ ¬q.
C . ⊥.
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.
Fim.

−0.35. D

A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.


B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).

Então:
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.

A . ∃x ∈ U, [¬(q(x) → p(x))].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

A . ¬p ∧ ¬q.
C . >.
D . ⊥.

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
Então:
Fim.

−0.35. D

B . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.

B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].
P

P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .

A . >.
B . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
B . (a) e (d).
D . Todas.
Fim.

−0.35. D

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
B . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . Todas.
D . (a) e (b).
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .
A . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].

A . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
D . (P → ¬Q) ∨ R.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . >.
D . ⊥.
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D

A . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∃x ∈ W, [¬(a(x) → b(x))].
D . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
A . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
Então:
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . (a) e (b).
C . Todas.
A . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
Fim.

−0.35. D
B . r → (p ⊕ q).
C . r → (p ∨ q).
D . (p ⊕ q) → r .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . >.
B . ⊥.
D . ¬p ∧ ¬q.

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= ¬Q.


Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
Fim.

−0.35. D
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
C . (a) e (b).
D . (a) e (d).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . >.
B . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.
Então:
A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).

B . (¬Q → P ) ∨ R.
C . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
Fim.

−0.35. D
B . (p ⊕ q) → r .
C . r → (p ∨ q).
D . r → (p ⊕ q).
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . Todas.
C . (a) e (b).

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . ∃x ∈ W, [¬(a(x) → b(x))].
B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
C . >.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
n
P
k
P
Pk+1 i Pk k
1−3 .
Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Então:
Fim.

−0.35. D

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
Então:

C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].


A . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q ∧ R.
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .
Fim.

−0.35. D

B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . Todas.
D . (a) e (b).
A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . >.
C . ⊥.
Então:
A . (p ⊕ q) → r .
B . r → (p ⊕ q).
C . r → (p ∨ q).

B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
C . ∃x ∈ W, [¬(a(x) → b(x))].
D . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
Fim.

−0.35. D

B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].
Então:

A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
A . r → (p ∨ q).
B . (p ⊕ q) → r .
C . r → (p ⊕ q).

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
C . >.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= Q.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Fim.

−0.35. D
Então:
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
B . P ∧ ¬Q → R.
C . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).
A . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].

A . ⊥.
C . >.
D . ¬p ∧ ¬q.

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
Fim.

−0.35. D
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
A . ∃x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . ⊥.
B . >.
D . ¬p ∧ ¬q.

A . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .

B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= Q.
Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
Então:

A . P → (¬Q ∨ R).
B . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.

Fim.

−0.35. D

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
Então:

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
D . >.
n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
A . (p ⊕ q) → r .
C . r → (p ⊕ q).
D . r → (p ∨ q).
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
Fim.

−0.35. D


A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
P

P
Pk+1 Pk
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
B . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . ¬p ∧ ¬q.
B . ⊥.
D . >.

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
B . r → (p ⊕ q).
C . r → (p ∨ q).
D . (p ⊕ q) → r .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].

Então:

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .

A . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
D . >.
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P
Pk+1 Pk 2
2 .
Fim.

−0.35. D

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= ¬P .

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).

Então:

A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.

A . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
n
P
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .
Fim.

−0.35. D
A . r → (p ⊕ q).
C . r → (p ∨ q).
D . (p ⊕ q) → r .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . Todas.
C . (a) e (b).
D . (a) e (d).

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
Então:

A . ⊥.
B . ¬p ∧ ¬q.
C . >.

B . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
Fim.

−0.35. D
Então:


A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
B . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.

A . ⊥.
B . >.
D . ¬p ∧ ¬q.
P

P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.
A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= ¬P .

A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
Então:
Fim.

−0.35. D

A . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . ¬(¬p ∧ q) ∧ ¬p.
C . >.
D . ⊥.
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . Todas.
C . (a) e (b).

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
Fim.

−0.35. D

A . >.
B . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.

A . P → (¬Q ∨ R).
B . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:


A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
Fim.

−0.35. D
Então:

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.
A . (p ⊕ q) → r .
B . r → (p ⊕ q).
C . r → (p ∨ q).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
B . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

Fim.

−0.35. D
Então:
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . {P, P → Q} |= ¬P .
B . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
D . r → (p ∨ q).

B . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).

Fim.

−0.35. D
Então:
A . r → (p ∨ q).
B . r → (p ⊕ q).
D . (p ⊕ q) → r .


A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . ¬p ∧ ¬q.
B . ⊥.
D . >.
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . ∀x, ∀y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
Fim.

−0.35. D
A . r → (p ⊕ q).
B . r → (p ∨ q).
D . (p ⊕ q) → r .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
C . (a) e (d).
D . (a) e (b).

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.

B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
Fim.

−0.35. D
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . >.
B . ⊥.
C . ¬p ∧ ¬q.
A . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .

B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
n
P
k
P
Pk+1 i Pk k+1
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + 3k+1 = 3 1−3 1−3 .
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .

Fim.

−0.35. D
B . ∃x, ∃y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ⊥.
D . >.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . P → (¬Q ∨ R).
C . (P → ¬Q) ∨ R.
D . (¬Q → P ) ∨ R.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= ¬Q.

P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Fim.

−0.35. D
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬Q.
A . (P → ¬Q) ∨ R.
B . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:


A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
D . >.
Fim.

−0.35. D

A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
D . r → (p ∨ q).

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

A . ⊥.
C . >.
D . ¬(¬p ∧ q) ∧ ¬p.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D

n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
B . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).

A . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:


A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= Q.
A . P ∧ ¬Q ∧ R.
B . P ∧ ¬Q → R.
D . P ∧ (¬Q → R).
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ⊥.
D . >.
Então:

A . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).
P

P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
Fim.

−0.35. D

A . ∃x ∈ W, [¬(a(x) → b(x))].
B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].

B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= P .
A . r → (p ∨ q).
B . (p ⊕ q) → r .
D . r → (p ⊕ q).
Então:
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

B . >.
C . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (b).
B . Todas.
C . (a) e (d).
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
Fim.

−0.35. D

B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . >.
D . ⊥.

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= P .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . (P → ¬Q) ∨ R.
B . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
Fim.

−0.35. D

A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.
A . ∃x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

n
P
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
B . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
C . (a) e (d).
D . Todas.

A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
Fim.

−0.35. D

B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
Então:

B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
n
P
k
P
Pk+1 i Pk k
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k+1

A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ⊥.
D . >.
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
Fim.

−0.35. D
A . r → (p ∨ q).
B . r → (p ⊕ q).
D . (p ⊕ q) → r .

B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
B . (a) e (d).
C . (a) e (b).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
A . ∀x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].

A . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . ⊥.
B . >.
C . ¬(¬p ∧ q) ∧ ¬p.
Fim.

−0.35. D

A . (P → ¬Q) ∨ R.
B . (¬Q → P ) ∨ R.
C . P → (¬Q ∨ R).
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
D . ⊥.

Então:


A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . ∀x ∈ U, [¬b(x) → ¬a(x)].
B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.
Fim.

−0.35. D

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].
A . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . >.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.


A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . (p ⊕ q) → r .
B . r → (p ⊕ q).
D . r → (p ∨ q).
Então:
Fim.

−0.35. D
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.

B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . >.
B . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.
B . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬a(x) → ¬b(x)].
A . P ∧ ¬Q ∧ R.
B . P ∧ ¬Q → R.
D . P ∧ (¬Q → R).
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . Todas.
C . (a) e (b).
D . (a) e (d).
Fim.

−0.35. D
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . Todas.
C . (a) e (d).
D . (a) e (b).

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

B . >.
C . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
B . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.

B . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).

B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
Então:

B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

P

P
Pk+1 Pk 2
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Fim.

−0.35. D
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬p ∧ ¬q.
B . >.
C . ⊥.

A . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
A . ∀x, ∀y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . Todas.
C . (a) e (b).
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
2 .
P
Pk+1 Pk 2
2 .

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
Fim.

−0.35. D

B . ¬p ∧ ¬q.
C . ⊥.
D . >.

(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
C . (a) e (d).
D . (a) e (b).
P

P
Pk+1 Pk 2
2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . {P ↔ Q, ¬Q} |= P .
B . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].

A . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).
D . (¬Q → P ) ∨ R.
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .
Fim.

−0.35. D
A . r → (p ∨ q).
B . (p ⊕ q) → r .
C . r → (p ⊕ q).
Então:

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . >.
B . ⊥.
C . ¬p ∧ ¬q.
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (b).
C . (a) e (d).
D . Todas.

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= ¬P .
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∃x ∈ W, [¬(a(x) → b(x))].
D . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
Fim.

−0.35. D

B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
C . Todas.
D . (a) e (b).

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
P

P
Pk+1 Pk
P
Pk+1 Pk 2
2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.
A . P ∧ (¬Q → R).
B . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
Fim.

−0.35. D
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
C . r → (p ∨ q).

B . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].
Então:

B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
A . ∀x, ∃y [B(x, y )].
B . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . >.
B . ¬(¬p ∧ q) ∧ ¬p.
C . ⊥.
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
C . (a) e (b).
D . Todas.

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .
Fim.

−0.35. D
n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .


A . (P → ¬Q) ∨ R.
B . P → (¬Q ∨ R).
C . (¬Q → P ) ∨ R.

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . >.
C . ⊥.
Então:


B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
Fim.

−0.35. D

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . Todas.
B . (a) e (b).
D . (a) e (d).


A . ∀x ∈ U, [¬s(x) → ¬t(x)].
B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
n
P
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Então:
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . ¬(¬p ∧ q) ∧ ¬p.
B . >.
D . ⊥.

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
D . {P, P → Q} |= ¬Q.
Fim.

−0.35. D

A . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
B . ∀x ∈ U, [¬b(x) → ¬a(x)].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .

A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.

(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . ∃x, ∀y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].
B . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q ∧ R.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

Fim.

−0.35. D

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
B . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
n
P
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k+1
1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

B . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
Fim.

−0.35. D

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
D . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . ⊥.
D . >.

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . r → (p ⊕ q).
C . r → (p ∨ q).
D . (p ⊕ q) → r .
C . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
C . (a) e (b).
D . Todas.
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

Fim.

−0.35. D
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . (P → ¬Q) ∨ R.
B . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).

B . ¬p ∧ ¬q.
C . >.
D . ⊥.

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.


(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
C . Todas.
D . (a) e (b).
A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
B . ∃x ∈ W, [¬(a(x) → b(x))].
D . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
P
Pk+1 Pk
Fim.

−0.35. D

A . {P ↔ Q, ¬Q} |= ¬P .
C . {P ↔ Q, ¬Q} |= Q.
D . {P ↔ Q, ¬Q} |= P .

B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∀x, ∀y [B(x, y )].

A . ⊥.
B . >.
D . ¬p ∧ ¬q.
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.

A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].
Fim.

−0.35. D

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
n
P
k
P
Pk+1 i Pk k
1−3 .
Pk k
i
) = 3 1−3
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .


A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
B . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
C . ∃x ∈ W, [¬(a(x) → b(x))].
A . ∃x, ∀y [B(x, y )].
C . ∃x, ∃y [B(x, y )].
D . ∀x, ∃y [B(x, y )].

A . (P → ¬Q) ∨ R.
B . P → (¬Q ∨ R).
D . (¬Q → P ) ∨ R.

B . ¬p ∧ ¬q.
C . >.
D . ⊥.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D

B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬a(x) → ¬b(x)].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].

A . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= ¬P .
D . {P, P → Q} |= P .
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∃y [B(x, y )].

B . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
D . >.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . P ∧ (¬Q → R).
C . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.
Então:
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
Fim.

−0.35. D
A . P ∧ ¬Q ∧ R.
C . P ∧ ¬Q → R.
D . P ∧ (¬Q → R).

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).

B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
D . ∀x ∈ U, [¬s(x) → ¬t(x)].

B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= P .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ⊥.
B . ¬(¬p ∧ q) ∧ ¬p.
C . >.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

A . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].

A . (¬Q → P ) ∨ R.
B . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).
A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

n
P
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Pk k
i
) = 3 1−3
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

A . >.
B . ¬p ∧ ¬q.
D . ⊥.
Fim.

−0.35. D

A . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∃x, ∃y [B(x, y )].

A . ⊥.
B . >.
D . ¬(¬p ∧ q) ∧ ¬p.
B . P ∧ ¬Q → R.
C . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).
Então:
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
B . ∃x ∈ W, [¬(a(x) → b(x))].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].

Fim.

−0.35. D

A . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . (a) e (b).
C . Todas.

A . ⊥.
C . >.
D . ¬p ∧ ¬q.


B . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).
Então:
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
Fim.

−0.35. D

A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].
D . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
B . (a) e (b).
D . (a) e (d).

A . {¬P, P ⊕ Q} |= ¬Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= Q.
A . r → (p ∨ q).
B . (p ⊕ q) → r .
D . r → (p ⊕ q).

A . ⊥.
C . >.
D . ¬p ∧ ¬q.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:


A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Fim.

−0.35. D

B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . >.
B . ¬p ∧ ¬q.
D . ⊥.

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . Todas.
D . (a) e (b).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
P
Pk+1 Pk 2
P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.


A . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
D . >.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].

A . ∃x ∈ U, [¬(q(x) → p(x))].
B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].

B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
Fim.

−0.35. D
A . ∃x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
D . ∀x, ∃y [B(x, y )].


A . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . ¬(¬p ∧ q) ∧ ¬p.
C . >.
D . ⊥.
Então:

A . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . (a) e (b).
C . Todas.
D . (a) e (d).

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
Fim.

−0.35. D
B . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . {P ↔ Q, ¬Q} |= P .
B . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.
A . P ∧ (¬Q → R).
B . P ∧ ¬Q ∧ R.
C . P ∧ ¬Q → R.
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
B . (a) e (d).
D . Todas.

B . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].

B . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
D . >.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

Fim.

−0.35. D
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
C . (a) e (b).
D . (a) e (d).
A . ∀x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].


A . ⊥.
B . >.
C . ¬(¬p ∧ q) ∧ ¬p.
A . P ∧ ¬Q → R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q ∧ R.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.
n
P
k
P
Pk+1 i Pk k
verdadeira e verificar que i=1 (3 ) = i=1 (3i ) + 3k+1 = 3 1−31−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .
k
P
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
Então:
Fim.

−0.35. D

A . (¬Q → P ) ∨ R.
C . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .

B . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= Q.
Fim.

−0.35. D

A . (P → ¬Q) ∨ R.
B . (¬Q → P ) ∨ R.
C . P → (¬Q ∨ R).

A . ⊥.
B . (¬p ∨ ¬q) ∧ (p ∨ q).
C . >.
P

P
Pk+1 Pk 2
2 .
Pk
P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, ¬R ∨ P } |= Q → ¬P .

A . {P, P → Q} |= P .
C . {P, P → Q} |= ¬Q.
D . {P, P → Q} |= ¬P .

B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
Fim.

−0.35. D

A . {P ↔ Q, ¬Q} |= Q.
B . {P ↔ Q, ¬Q} |= P .
C . {P ↔ Q, ¬Q} |= ¬P .
A . P ∧ ¬Q ∧ R.
B . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.


A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
A . ∃x, ∀y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∃x, ∃y [B(x, y )].
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
Fim.

−0.35. D

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
C . (a) e (b).
D . Todas.
A . ∀x, ∃y [B(x, y )].
C . ∀x, ∀y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∃x ∈ U, [¬(q(x) → p(x))].
P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk 2
2 .
P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
A . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.

B . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
Fim.

−0.35. D

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
B . Todas.
C . (a) e (d).
D . (a) e (b).

A . {P ↔ Q, ¬Q} |= Q.
B . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .

A . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

B . ∃x ∈ W, [¬(a(x) → b(x))].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].

P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn

B . >.
C . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.

A . P → (¬Q ∨ R).
B . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
Fim.

−0.35. D

A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . Todas.
B . (a) e (b).
D . (a) e (d).
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .

A . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
A . r → (p ∨ q).
C . (p ⊕ q) → r .
D . r → (p ⊕ q).
A . ∃x, ∃y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].
Então:

A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= ¬Q.
Fim.

−0.35. D
n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .

A . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
B . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
C . ∃x ∈ U, [¬(q(x) → p(x))].

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .
(a) : ¬x ∨ y . (b) : (x ∧ y ) ∨ z . (c) : y → x. (d) : (¬x ∨ y ) ↔ (x ∨ z).
Então:

B . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

B . r → (p ∨ q).
C . r → (p ⊕ q).
D . (p ⊕ q) → r .
Fim.

−0.35. D

A . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
D . {P ↔ Q, ¬Q} |= ¬P .

A . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

A . P ∧ (¬Q → R).
B . P ∧ ¬Q → R.
C . P ∧ ¬Q ∧ R.
Então:
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
Pn n−3
i=1 (2 ) = 16 1−2
1−2 e
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

B . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
D . >.
Fim.

−0.35. D

B . >.
C . ⊥.
D . ¬(¬p ∧ q) ∧ ¬p.
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:

n−3
P
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .
B . P ∧ ¬Q → R.
C . P ∧ ¬Q ∧ R.
D . P ∧ (¬Q → R).

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
Fim.

−0.35. D

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= ¬Q.

A . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
D . >.
Então:

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

P

P
Pk+1 Pk 2
2 .
P
Pk+1 Pk
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
B . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

A . (¬Q → P ) ∨ R.
B . P → (¬Q ∨ R).
D . (P → ¬Q) ∨ R.
Fim.

−0.35. D
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P


A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
Então:

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= ¬P .
C . {P, P → Q} |= P .
A . >.
C . ⊥.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
A . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
A . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
Fim.

−0.35. D
n
P
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
k
P
Pk+1 i Pk k
1−3 .

A . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).

(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . ∀x ∈ W, [a(x) → b(x)] ∧ ∀x ∈ W, [b(x) → a(x)].
C . ∀x ∈ W, [a(x) → b(x)] ∨ ∀x ∈ W, [b(x) → a(x)].
D . ∃x ∈ W, [¬(a(x) → b(x))].

A . {P, P → Q} |= P .
B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= ¬P .
A . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . ¬(¬p ∧ q) ∧ ¬p.
B . ⊥.
D . >.
B . (p ⊕ q) → r .
C . r → (p ⊕ q).
D . r → (p ∨ q).

(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
C . Todas.
D . (a) e (b).
Fim.

−0.35. D
P

P

P Pk k
i=1 (5i ) = i=1 (5i ) + 5k + 5 = (5 + 5k) 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + k + 1 = 2 .
Pk
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
Então:

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .


A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . >.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . ⊥.
A . ∀x, ∀y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].

A . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.
D . P → (¬Q ∨ R).
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

A . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

B . >.
C . ¬(¬p ∧ q) ∧ ¬p.
D . ⊥.
P

P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).

B . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
C . ∀x ∈ U, [¬b(x) → ¬a(x)].
D . ∀x ∈ U, [¬a(x) → ¬b(x)].

B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
A . r → (p ∨ q).
B . r → (p ⊕ q).
C . (p ⊕ q) → r .

Fim.

−0.35. D

A . ¬p ∧ ¬q.
C . ⊥.
D . >.
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= Q → ¬P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
D . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
A . ∀x, ∀y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .
A . r → (p ∨ q).
B . r → (p ⊕ q).
D . (p ⊕ q) → r .
Então:
Fim.

−0.35. D
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (d).
B . Todas.
C . (a) e (b).

B . ⊥.
C . >.
D . ¬(¬p ∧ q) ∧ ¬p.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, ¬R ∨ P } |= Q → ¬P .
C . {R → Q, R ∨ ¬P } |= Q → ¬P .
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
B . (p ⊕ q) → r .
C . r → (p ∨ q).
D . r → (p ⊕ q).

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].

A . {P, P → Q} |= ¬Q.
B . {P, P → Q} |= P .
C . {P, P → Q} |= ¬P .

A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
B . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
C . ¬(¬(p ∧ q) ∨ p) ≡ p.
Fim.

−0.35. D
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
C . {Q → R, ¬R ∨ P } |= Q → ¬P .

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
B . P ∧ (¬Q → R).
C . P ∧ ¬Q → R.
D . P ∧ ¬Q ∧ R.
A . ∀x, ∀y [B(x, y )].
C . ∀x, ∃y [B(x, y )].
D . ∃x, ∀y [B(x, y )].

A . {¬P, P ⊕ Q} |= ¬Q.
B . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.
Então:
A . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].
B . ∃x ∈ U, [¬(q(x) → p(x))].
C . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
n−3
P
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
n−3
P
1−2 e


A . ⊥.
B . >.
D . ¬p ∧ ¬q.
Fim.

−0.35. D


A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
A . {Q → R, ¬R ∨ P } |= Q → ¬P .
B . {R → Q, R ∨ ¬P } |= Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
P

P
5k 2 +15k+10
P Pk
i=1 (5i ) = i=1 (5i ) + 5k + 5 = 2 .
P
Pk+1 Pk 2
2 .
P
Pk+1 Pk

A . {¬P, P ⊕ Q} |= P .
C . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.
C . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].
(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:

A . P → (¬Q ∨ R).
B . (¬Q → P ) ∨ R.
C . (P → ¬Q) ∨ R.

B . ⊥.
C . >.
D . ¬p ∧ ¬q.

B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
Fim.

−0.35. D
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .


B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .

Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
B . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].
B . P ∧ ¬Q ∧ R.
C . P ∧ (¬Q → R).
D . P ∧ ¬Q → R.
A . ⊥.
C . >.
D . (¬p ∨ ¬q) ∧ (p ∨ q).
Então:

B . {P, P → Q} |= ¬Q.
C . {P, P → Q} |= P .
D . {P, P → Q} |= ¬P .

A . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
C . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
Fim.

−0.35. D
Então:

A . P ∧ (¬Q → R).
B . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.
A . ∃x, ∃y [B(x, y )].
B . ∀x, ∃y [B(x, y )].
C . ∃x, ∀y [B(x, y )].

B . {¬P, P ⊕ Q} |= Q.
C . {¬P, P ⊕ Q} |= P .
D . {¬P, P ⊕ Q} |= ¬Q.
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
D . ∃x ∈ W, [¬q1 (x) ∧ ¬q2 (x) ∧ ... ∧ ¬qn (x) → ¬p(x)].

A . ⊥.
B . >.
C . ¬(¬p ∧ q) ∧ ¬p.

A . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
B . ¬(¬(p ∧ q) ∨ p) ≡ p.
C . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
Fim.

−0.35. D

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.
Então:
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
D . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . ¬(¬(p ∧ q) ∨ p) ≡ p.
B . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
D . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.

A . ∃x ∈ U, [¬(q(x) → p(x))].
B . ∀x ∈ U, [q(x) → p(x)] ∧ ∀x ∈ U, [p(x) → q(x)].
D . ∀x ∈ U, [q(x) → p(x)] ∨ ∀x ∈ U, [p(x) → q(x)].

A . (¬p ∨ ¬q) ∧ (p ∨ q).
B . ⊥.
D . >.
n
P
k
P
k
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .
k
P
1−3k+1
P i
Pk i
i=1 (3 ) = i=1 (3 ) + (k + 1) = 3 1−3 .

Pk k
i
) = 3 1−3
k+1
Pk
i i k+1
= 3 1−3
P
i=1 (3 ) = i=1 (3 ) + 3 1−3 .

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).
D . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).

A . {¬P, P ⊕ Q} |= Q.
B . {¬P, P ⊕ Q} |= ¬Q.
D . {¬P, P ⊕ Q} |= P .
A . r → (p ⊕ q).
B . (p ⊕ q) → r .
D . r → (p ∨ q).
Fim.

−0.35. D
(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

A . (a) e (b).
C . Todas.
D . (a) e (d).
A . P ∧ (¬Q → R).
B . P ∧ ¬Q ∧ R.
D . P ∧ ¬Q → R.

A . {¬P, P ⊕ Q} |= P .
B . {¬P, P ⊕ Q} |= Q.
D . {¬P, P ⊕ Q} |= ¬Q.

A . (P (1, 1) ∧ P (1, 2)) ∧ (P (2, 1) ∧ P (2, 2)).
C . (P (1, a) ∨ P (2, a)) ∨ (P (1, b) ∨ P (2, b)).
D . (P (a, 1) ∨ P (a, 2)) ∨ (P (b, 1) ∨ P (b, 2)).
n−3
P
n−3
P
1−2 e
k−3
P (k) : ki=1 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=1 (2 ) =
i
i=1 (2 ) + 2
k+1
= 16 1−2
1−2 .
k−3
P (k) : ki=4 (2i ) = 16 1−2
P
Pk+1 i Pk k−2
i=4 (2 ) =
i
i=4 (2 ) + 2
k+1
= 16 1−2
1−2 .
A . ¬((p ∨ ¬p) ∧ (q ∨ ¬q)) ≡⊥.
C . ¬(¬(p ∧ q) ∨ p) ≡ p ∨ q.
D . ¬(¬(p ∧ q) ∨ p) ≡ p.

B . ⊥.
C . ¬(¬p ∧ q) ∧ ¬p.
D . >.
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
B . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .

A . ∀x ∈ U, [¬t(x) → ¬s(x)].
C . ∀x ∈ U, [¬s(x) → ¬t(x)].
D . ∀x ∈ U, [¬s(x) ∧ ¬t(x) →⊥].
(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .
Então:
Fim.

−0.35. D
Então:

A . {P ↔ Q, ¬Q} |= P .
B . {P ↔ Q, ¬Q} |= ¬P .
D . {P ↔ Q, ¬Q} |= Q.
A . ∀x, ∃y [B(x, y )].
B . ∃x, ∀y [B(x, y )].
D . ∀x, ∀y [B(x, y )].
A . ∃x ∈ Y, [¬α1 (x) ∧ ¬α2 (x) ∧ ... ∧ ¬αn (x) → ¬β(x)].


A . (P → ¬Q) ∨ R.
C . (¬Q → P ) ∨ R.
D . P → (¬Q ∨ R).
P

P
Pk+1 Pk
i=1 (2i + 3) = i=1 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
Pn
P
Pk+1 Pk
i=2 (2i + 3) = i=2 (2i + 3) + 2(k + 1) + 3 = k(k + 6).
A . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
C . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .

A . ¬p ∧ ¬q.
B . >.
D . ⊥.

Ω : (p ∧ ¬p) → (q ∨ ¬q). Então:
Fim.

−0.35. D
n
P
k
P
Pk+1 i Pk k
1−3 .
k
P
Pk+1 i Pk k+1
k
P
Pk+1 i Pk k+1
1−3 .
A . {R → Q, R ∨ ¬P } |= ¬Q → ¬P .
C . {Q → R, R ∨ ¬P } |= ¬Q → ¬P .
D . {R → Q, R ∨ ¬P } ≡ ¬Q → ¬P .

A . {P ↔ Q, ¬Q} |= ¬P .
B . {P ↔ Q, ¬Q} |= Q.
C . {P ↔ Q, ¬Q} |= P .

A . ∀x ∈ U, [¬a(x) → ¬b(x)].
C . ∀x ∈ U, [¬a(x) ∧ ¬b(x) →⊥].
D . ∀x ∈ U, [¬b(x) → ¬a(x)].

A . ⊥.
C . (¬p ∨ ¬q) ∧ (p ∨ q).
D . >.
(a) p → p.
(b) p ∧ ¬p.
(c) p ∧ >.
(d) p ∨ >.
A . (a) e (d).
B . (a) e (b).
D . Todas.
Então:

A . (P (1, α) ∨ P (1, β)) ∧ (P (2, α) ∨ P (2, β)).
B . (P (1, α) ∨ P (1, β)) ∨ (P (2, α) ∨ P (2, β)).
C . (P (1, α) ∧ P (1, β)) ∨ (P (2, α) ∧ P (2, β)).

B . (P → ¬Q) ∨ R.
C . P → (¬Q ∨ R).
D . (¬Q → P ) ∨ R.

Fim.

Untitled

Enviado por

Dados do documento

Descrição original:

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Untitled

Enviado por

Direitos autorais:

Formatos disponíveis

Tópicos de Matemática Discreta

2o semestre do ano letivo 2021/2022 — MIEGSI, Departamento de Matemática, Universidade do Minho

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.2 Considere as fórmulas π : (p ∧ (q ∨ r )) → (p ∧ q) e

I.4 Sabendo que x → y é uma proposição falsa, considere as seguintes proposições:

(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .

I.7 Considere as seguintes fórmulas proposicionais: ϕ : p → (p ∨ q) e ψ : (q ∧ p) → r . Então:

I.8 A proposição P : ((¬p ∨ ¬q) ∧ q) → ¬p é logicamente equivalente a:

I.10 Mostrar que ∀x ∈ W, [a(x) ↔ b(x)], é o mesmo que mostrar,

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.1 Considere as seguintes fórmulas proposicionais: ϕ : p → (p ∨ q) e ψ : (q ∧ p) → r . Então:

I.3 Considere as seguintes proposições: P1 : p → p, P2 : p∧ ⊥ e P3 : p ⊕ ¬p. Então:

Qual das seguintes proposições é verdadeira?

I.5 Indique quais dos seguintes argumentos é válido:

I.8 Sabendo que x → y é uma proposição falsa, considere as seguintes proposições:

(a) : x ∨ y . (b) : x ∧ y . (c) : y → x. (d) : ¬x ∨ y ↔ x ∨ y .

I.9 A proposição P : (p ∧ q) → (p ∨ q) é logicamente equivalente a:

I.10 A proposição ∃x ∈ {a, b}∃y ∈ {1, 2}P (x, y ) é logicamente equivalente a:

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.1 Sabendo que p → q é uma proposição falsa, considere as seguintes proposições:

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.

I.3 Mostrar que ∀x ∈ U, [q(x) ↔ p(x)], é o mesmo que mostrar,

I.4 Considere as seguintes fórmulas proposicionais: ϕ : p → (p ∨ q) e ψ : (q ∧ p) → r . Então:

I.5 Indique quais dos seguintes argumentos é válido:

I.6 Considere as seguintes expressões lógicas:

(a) : p∧ ⊥ . (b) : p ↔ ¬p. (c) : p ∨ ¬p. (d) : ¬p.

Quais destas expressões lógicas são contradições?

I.10 A proposição ∃x ∈ {a, b}∃y ∈ {1, 2}P (x, y ) é logicamente equivalente a:

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.1 Considere as proposições P1 : p → q e P2 : ¬(p → ¬q) ∨ (p → ¬q). Então:

I.2 A proposição P : (p ∧ q) → (p ∨ q) é logicamente equivalente a:

I.3 Mostrar que ∀x ∈ U, [q(x) ↔ p(x)], é o mesmo que mostrar,

(a) : ¬x ∨ y . (b) : (x ∧ y ) ∨ z. (c) : y → x. (d) : (¬x ∨ y ) ↔ (x ∨ z).

I.5 Qual das seguintes proposições é verdadeira:

I.6 Indique quais dos seguintes argumentos é válido:

D . Nenhuma das outras opções.

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.2 Considere as seguintes expressões lógicas:

I.3 A proposição P : ¬(p ∨ (¬p ∧ q)) é logicamente equivalente a:

I.4 Qual das seguintes proposições é verdadeira:

I.5 Indique quais dos seguintes argumentos é válido:

com base n0 . Qual das seguintes proposições é verdadeira?

mostrar que P (1) é proposição verdadeira.

I.8 Sabendo que p → q é uma proposição falsa, considere as seguintes proposições:

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.

I.9 Considere as proposições: P: “O céu é vermelho.” Q: “O mar é azul” R: “Amanhã é sábado.”

I.10 Mostrar que ∀x ∈ W, [a(x) ↔ b(x)], é o mesmo que mostrar,

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

Qual das seguintes proposições é verdadeira?

I.2 A proposição P : ((¬p ∨ ¬q) ∧ q) → ¬p é logicamente equivalente a:

I.3 Mostrar que ∀x ∈ U, [s(x) → t(x)], é o mesmo que mostrar,

I.4 Considere as proposições P1 : p → q e P2 : ¬(p → ¬q) ∨ (p → ¬q). Então:

I.5 Qual das seguintes proposições é verdadeira:

I.6 A proposição ∃x ∈ {a, b}∃y ∈ {1, 2}P (x, y ) é logicamente equivalente a:

(a) : ¬p ∨ q. (b) : (p ∧ q) ∨ r. (c) : q → p. (d) : (¬p ∨ q) ↔ (p ∨ r ).

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.2 Considere as seguintes fórmulas proposicionais: ϕ : p → (p ∨ q) e ψ : (q ∧ p) → r . Então:

I.6 Indique quais dos seguintes argumentos é válido:

(a) : p ∨ q. (b) : p ∧ q. (c) : q → p. (d) : ¬p ∨ q ↔ p ∨ q.

I.8 Considere as seguintes expressões lógicas:

I.10 A proposição P : ((¬p ∨ ¬q) ∧ q) → ¬p é logicamente equivalente a:

Grupo I — Para cada questão deste grupo, assinale através de uma 1 2 3 4 5 6 7 8 9 10

I.2 Considere as seguintes expressões lógicas: