Specify the domain as a list of natural numbers (e.g., 0, 1, 2). For each constant, give its denotation. For each one-place predicate, list the domain elements it applies to. For two-place predicates, list ordered pairs such as [0, 1]; for three-place predicates, ordered triples.

Consistency

For each set of sentences below, provide a model in which they are all true.

1.1 Open ↗
1.2 Open ↗
1.3 Open ↗
1.4 Open ↗
1.5 Open ↗
1.6 Open ↗
1.7 Open ↗
1.8 Open ↗
1.9 Open ↗
1.10 Open ↗

Equivalence

Provide a counterexample to the equivalence of each pair of sentences: build a model in which one is true and the other is false.

2.11 Open ↗
2.12 Open ↗
2.13 Open ↗

Validity

Provide a counterexample to the validity of each argument: build a model in which the premises are all true but the conclusion is false. The negation of the conclusion appears as the last formula.

3.14 Open ↗
3.15 Open ↗
3.16 Open ↗
3.17 Open ↗
3.18 Open ↗
3.19 Open ↗
3.20 Open ↗