Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.

Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.

Schoenflies point groups are presented in terms of spatial partitions and Laue classes based on abstract groups. A much simpler system using only a minimal set of generators for three dimensional groups is then presented in the same form. This simplified treatment allows group operations of a given Laue class to be correlated to a greatly simplified Mulliken-style notation for irreducible representations of that class. Transformation matrix representations of point groups in the simplified style can then be manipulated according to (...) their position in the class or to their sub-groups in very clear procedures. Simple rules can replace the large numbers of tables necessary in the Schoenflies approach. Some applications of the method are described. (shrink)