logically equivalent
By comparing the last column here with the truth table for p ⇒ q (see implication), it can be seen that (¬p) ∨ q and p ⇒ q are logically equivalent. This equivalence is the basis of proof by contradiction.
- algorithmic complexity
- aliquant part
- aliquot part
- al-Khwārizmī
- almost all
- almost disjoint
- almost surely
- almost uniform convergence
- alphabet
- alternate angles
- alternating function
- alternating group
- alternating series
- alternating series test
- alternative hypothesis
- altitude
- altitude
- ambiguous case
- AM-GM
- amicable numbers
- amplitude
- AMS
- An
- analog device
- analysis