Consider the following:
p: This computer is good.
q: This computer is cheap.
Write the statement in symbolic form:
This computer is not good but cheap.

Answer

To convert the statement "This computer is not good but cheap" into symbolic form, we will follow these steps:

1. **Identify the Statements**:
- Let \( p \) represent "This computer is good."
- Let \( q \) represent "This computer is cheap."

2. **Negate the Statement**:
- The phrase "not good" corresponds to the negation of \( p \), which is represented as \( \neg p \).

3. **Combine the Statements**:
- The word "but" in logical terms can be treated as "and." Therefore, we need to combine \( \neg p \) (not good) and \( q \) (cheap) using the logical conjunction operator \( \land \).

4. **Write the Final Symbolic Form**:
- The complete symbolic representation of the statement "This computer is not good but cheap" is:
\[ \neg p \land q \]

### Summary of Steps:
1. Identify \( p \) and \( q \).
2. Negate \( p \) to get \( \neg p \).
3. Use "and" to combine \( \neg p \) and \( q \).
4. Write the final expression: \( \neg p \land q \).