명제와 조건 연습문제 — Sundstrom, Mathematical Reasoning · 2.1절 · 11a번

Sundstrom, Mathematical Reasoning · 2.1절 · 11a번영어 원문

For statements $P$ and $Q$ , use truth tables to determine if each of the following statements is a tautology, a contradiction, or neither.

$\neg Q \vee (P \to Q)$ .

정답·풀이 보기 (영어 원문)

$\neg Q \vee (P \to Q)$ is a tautology.

한 번 더 — 비슷한 문제Sundstrom, Mathematical Reasoning · 2.2절 · 3d번영어 원문

Write a useful negation of each of the following statements. Do not leave a negation as a prefix of a statement. For example, we would write the negation of “I will play golf and I will mow the lawn” as “I will not play golf or I will not mow the lawn.”

If we do not win the first game, then we will not play a second game.

다 풀었으면 정답 확인

We do not win the first game and we will play a second game.

이 문제로 이어서 풀기

# 명제와 조건계산자동 분류