Animated Logical Graphs • 60

Posted on February 21, 2021 by Jon Awbrey

Re: Laws of Form • Lyle Anderson
Re: Richard J. Lipton • The Art Of Math
Re: Animated Logical Graphs • (57) • (58) • (59)

LA:
Definition 1.  A group (G, *) is a set G together with a binary operation * : G \times G \to G satisfying the following three conditions.
  1. Associativity.  For any x, y, z \in G, we have (x * y) * z = x * (y * z).
  2. Identity.  There is an identity element e \in G such that \forall g \in G,
    we have e * g = g * e = g.
  3. Inverses.  Each element has an inverse, that is, for each g \in G,
    there is some h \in G such that g * h = h * g = e.

Dear Lyle,

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 G is said to “act on” a set X by permuting its elements among themselves.  In the work we do here, each group G we contemplate will act a set X 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.

Resources

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)

This entry was posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.