∑ZWMath CoursesSyllabusExercises
ES
ZWMath›Logic›Propositional logic›Contradiction›ZW-CONTRADICTION-004
Course menu
AreaLogicTopicPropositional logic
Propositional logic11
  • Proposition
  • Logical operator
  • Negation
  • Conjunction
  • Disjunction
  • Implication
  • Logical equivalence
  • NAND
  • Truth table
  • Tautology
  • Contradiction
Predicate logic5
  • Predicate
  • Universal quantifier
  • Existential quantifier
  • Negation of quantifiers
  • Order of quantifiers
Proof theory6
  • Axiomatic system
  • Rule of inference
  • Modus ponens
  • Formal proof
  • Consistency
  • Logical completeness
Completeness and incompleteness2
  • Gödel’s incompleteness
  • Arithmetic

Exercise · ZW-CONTRADICTION-004 · ★☆☆ Basic

If P is true, P ∧ ¬P turns out...

Choose one option.

Show answer
  • C. False

← Back to the question

Explanation

With \(P=T\), \(\neg P=F\) and the conjunction \(T\land F\) gives F.

Open the ZWMath map →

Review the concept: Contradiction

A compound proposition \(P\) is a contradiction if it is false under every assignment of its components.

\[P\land\neg P\equiv\bot\]

More practice problems: contradiction

  • ZW-CONTRADICTION-001 A contradiction is false...
  • ZW-CONTRADICTION-002 Which one is a contradiction?
  • ZW-CONTRADICTION-003 In the table of a contradiction, the final column contains...
  • ZW-CONTRADICTION-005 A contradiction cannot be true...
  • ZW-CONTRADICTION-006 Under which assignments is a contradiction false?
  • ZW-CONTRADICTION-007 Which of these formulas is a contradiction?
  • ZW-CONTRADICTION-008 The final column of a contradiction contains...
  • ZW-CONTRADICTION-009 Which of these formulas is contradictory?

← ZW-CONTRADICTION-003 ZW-CONTRADICTION-005 →

Practice

☰All exercises
✦Open on free study↗Open on the map

ZWMath · Math from definition to practice. Open the interactive map · Syllabus · All exercises

Author: ORCID iD 0009-0009-8641-3511

Privacy · About Speedrunz · Contact