- Definition 1. A group is a set together with a binary operation satisfying the following three conditions.
- Associativity. For any we have
- Identity. There is an identity element such that
- Inverses. Each element has an inverse, that is, for each
there is some such that
Thanks for supplying that definition of a mathematical group. It will afford us a wealth of useful concepts and notations as we proceed. As you know, the above three axioms define what is properly called an abstract group. Over the course of group theory’s history this definition was gradually abstracted from the more concrete examples of permutation groups and transformation groups initially arising in the theory of equations and their solvability.
As it happens, the application of group theory I’ll be developing over the next several posts will be using the more concrete type of structure, where a transformation group is said to “act on” a set by permuting its elements among themselves. In the work we do here, each group we contemplate will act a set which may be viewed as either one of two things, either a canonical set of expressions in a formal language or the mathematical objects denoted by those expressions.
What you say about deriving arithmetic, algebra, group theory, and all the rest from the calculus of indications may well be true, but it remains to be shown if so, and that’s a ways down the road from here.
- Logic Syllabus
- Logical Graphs
- Duality Indicating Unity
- Futures Of Logical Graphs
- Minimal Negation Operators
- Survey of Theme One Program
- Survey of Animated Logical Graphs
- Propositional Equation Reasoning Systems
- Applications • Constraint Satisfaction Problems
cc: Cybernetics (1) (2) • Laws of Form • FB | Logical Graphs • Ontolog Forum (1) (2)
• Peirce List (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) • Structural Modeling (1) (2)
• Systems Science (1) (2)