I think I solved it. Since (by axiom group 2 of Enderton's book and modus ponens) and by assumption, which means , i.e., inconsistent.

Results 1 to 3 of 3

- November 10th 2011, 05:55 AM #1

- Joined
- Nov 2011
- Posts
- 59

## Fol 6

Enderton problem 4 in Section 2.5

Let . Is consistent? Is satisfiable?

The completeness theorem says that any consistent set of formulas is satisfiable. Therefore, we only need to show that is consistent.

Suppose to the contrary, towards a contradiction, . Then, we have both and for any wff . I am looking for a counterexample , which is either or , not both.

Any help will be appreciated.

- November 10th 2011, 06:18 AM #2

- Joined
- Nov 2011
- Posts
- 59

- November 10th 2011, 07:10 AM #3

- Joined
- Oct 2009
- Posts
- 5,569
- Thanks
- 789