Colin Howson, [1997] Logic with trees Chapter 12 Section 2
The Howson [1997] does not expand on modal logic (and modal trees) so a text like
Rod Girle [2000] Modal Logics and Philosophy
would definitely be a help here.
[Modal logic is a vast area, what is being presented here is the briefest of glimpses through the shop window (a book like the Girle would help you go further).]
2013
The Colin Howson book uses a notation like R(a,b,c) for the application of a predicate R to the arguments or terms a, b, c.
It employs the upper case letters A-Z, perhaps followed by subscripts, to be predicates, so, for example, R, S₁, T₁2 are all predicates.
The software supports this.
But the software makes an extension.
Often, when working informally, authors will write Red(x) to mean that the predicate Red is applied to the variable x.
2013
Colin Howson, [1997] Logic with trees Chapter 11
Set theory is an extensive topic introduced elsewhere. It can be written as a first order theory.
There is one axiom schema, Abstraction (or Comprehension), which can generate infinitely many axioms
2013
Colin Howson, [1997] Logic with trees Chapter 9 & 11
It is common in this setting (which is arithmetic) to use functional terms like s(x), s(1), s(0) to mean the successor of x, 1, and 0, respectively. Equally common is the notation x', 1', and 0' to mean the same thing. The latter is quicker and shorter (though not semi-nmemonic)-- we will use it here.
2013
Colin Howson, [1997] Logic with trees Chapter 9
Groups can be characterized by three proper symbols {=,+,0} (ie identity, one infix operator, we will use '+', and an identify element '0') and the three proper axioms
Colin Howson, [1997] Logic with trees
The word 'terms' in logic means 'names' and thus far we have met two kinds of terms: constants (or proper names), and variables.
2013
Colin Howson, [1997] Logic with trees Chapter 2
Howson [1997] has a number of exercises. Many of them you will be able to do in the Widget below.
Here are a few hints
2013
You need to know some propositional logic to be able to understand the tutorials to come. In particular, you need to know about the symbols used in propositional logic, truth tables, satisfiability, consistency, and semantic invalidity (by counter example). You do not need to know propositional rules of inference and derivations.
Howson [1997] will give you enough background.
Alternatively you could look at the first five propositional tutorials in Easy Deriver