Each letter is a statement, true or false. Every clue holds, and exactly one assignment satisfies them all. Three puzzles a day; pick one.
How to play
Each letter is a statement that is either true or false. Every clue is true. Exactly one combination satisfies all of them. Find it.
¬A not A · A → B if A then B (only broken when A is true and B is false) · A ↔ B same value · A ⊕ B different values · A ∨ B at least one · A ∧ B both.
No givens? Pick the letter that appears in the most clues, assume it's true, and follow the chain. A contradiction proves it's false.