Conjunction

Conjunction

graph TD; Conjunction --> A[And]; Conjunction --> B[Or]; Conjunction --> C[Not]; A --> D[Both conditions are true]; B --> E[At least one condition is true]; C --> F[The condition is not true];