MHB Digraph of a Binary Positional Tree

  • Thread starter Thread starter Brian82784
  • Start date Start date
  • Tags Tags
    Binary Tree
AI Thread Summary
The discussion centers on understanding the drawing of a digraph for a binary positional tree. One participant seeks confirmation on their interpretation of the tree's structure, questioning whether a positional tree implies ordered subtrees. Another participant points out that the provided tree image does not represent a binary tree. Additionally, there is a request for clarification on the definition of a digraph in relation to positional trees. The conversation highlights the need for precise definitions in tree structures and their graphical representations.
Brian82784
Messages
19
Reaction score
0
Hello-
I think I understand how to draw a digraph of the given binary positional tree in my work. Could someone please tell me if I've got it correct, or if I'm not even close?

View attachment 2338
 

Attachments

  • Tree.jpg
    Tree.jpg
    29.3 KB · Views: 85
Physics news on Phys.org
By a positional tree, do you mean a tree where subtrees are ordered? By the way, the tree in your picture is not binary.

I am not familiar with a way a digraph is associated with a positional tree. Can you provide a definition?
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top