Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.
1.1k questions
1.3k answers
1.7k comments
557 users
Given boolean variables p0, p1, p2, and p3, each pair of the form (pi,pi+1) (i ∈ {0, 1, 2}) is called an adjacent pair. Construct a propositional logic formula φ that holds if and only if no adjacent pair consists of two variables that are evaluated to true.
can (p0 ⊕ p1) & (p1 ⊕ p2) & (p2 ⊕ p3) be an alternate solution for above question?