OurBigBook About$ Donate
 Sign in Sign up

Logical biconditional (P↔Q)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Mathematical logic Propositional logic Proposition Logical connective
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A binary logical connective true exactly when its two arguments have the same truth value. It is logically equivalent to (P→Q)∧(Q→P), and hence to (¬P∨Q)∧(¬Q∨P). Its truth table has value one on input pairs (0,0) and (1,1), and zero on (0,1) and (1,0).

 Ancestors (8)

  1. Logical connective
  2. Proposition
  3. Propositional logic
  4. Mathematical logic
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Digital systems, linear algebra and introduction to formal proof / 7 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook