volume_mute

Equivalent wffs

publish date: 2022/08/17 01:22:00 GMT+10

volume_mute

Suppose that P ↔ Q is a tautology and truth table for all letters in both statements agree for every row.  In this case P and Q are said to be equivalent wffs, denoted by

P ⇄ Q
P ⇌ Q
P ⇔ Q
P ⇿ Q

Correct Answer

P ⇔ Q

Reference

Mathematical Structures for Computer Science, Discrete Mathematics and its Applications, seventh edition

Quizzes you can take where this question appears