Changes

|}

|}

This can be written inline as <math>{}^{\backprime\backprime} \texttt{(~(~)~)} = \quad {}^{\prime\prime}\!</math> or set off in a text display as follows:

This can be written inline as <math>{}^{\backprime\backprime} \texttt{( ( ) )} = \quad {}^{\prime\prime}\!</math> or set off in a text display as follows:

{| align="center" cellpadding="10"

{| align="center" cellpadding="10"

| width="33%" | <math>\texttt{(~(~)~)}\!</math>

| width="33%" | <math>\texttt{( ( ) )}\!</math>

| width="34%" | <math>=\!</math>

| width="34%" | <math>=\!</math>

| width="33%" | &nbsp;

| width="33%" | &nbsp;

This ritual is called ''traversing'' the tree, and the string read off is called the ''traversal string'' of the tree.  The reverse ritual, that passes from the string to the tree, is called ''parsing'' the string, and the tree constructed is called the ''parse graph'' of the string.  The speakers thereof tend to be a bit loose in this language, often using ''parse string'' to mean the string that gets parsed into the associated graph.

This ritual is called ''traversing'' the tree, and the string read off is called the ''traversal string'' of the tree.  The reverse ritual, that passes from the string to the tree, is called ''parsing'' the string, and the tree constructed is called the ''parse graph'' of the string.  The speakers thereof tend to be a bit loose in this language, often using ''parse string'' to mean the string that gets parsed into the associated graph.

We have treated in some detail various forms of the initial equation or logical axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(~(~)~)} = \quad {}^{\prime\prime}.~\!</math>  For the sake of comparison, let's record the plane-embedded and topological dual forms of the axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(~)(~)} = \texttt{(~)} {}^{\prime\prime}.\!</math>

We have treated in some detail various forms of the initial equation or logical axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{( ( ) )} = \quad {}^{\prime\prime}.~\!</math>  For the sake of comparison, let's record the plane-embedded and topological dual forms of the axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{( )( )} = \texttt{( )} {}^{\prime\prime}.\!</math>

First the plane-embedded maps:

First the plane-embedded maps:

|}

|}

The choice of axioms for any formal system is to some degree a matter of aesthetics, as it is commonly the case that many different selections of formal rules will serve as axioms to derive all the rest as theorems.  As it happens, the example of an algebraic law that we noticed first, <math>a(~) = (~),\!</math> as simple as it appears, proves to be provable as a theorem on the grounds of the foregoing axioms.

The choice of axioms for any formal system is to some degree a matter of aesthetics, as it is commonly the case that many different selections of formal rules will serve as axioms to derive all the rest as theorems.  As it happens, the example of an algebraic law that we noticed first, <math>a \texttt{( )} = \texttt{( )},~\!</math> as simple as it appears, proves to be provable as a theorem on the grounds of the foregoing axioms.

We might also notice at this point a subtle difference between the primary arithmetic and the primary algebra with respect to the grounds of justification that we have naturally if tacitly adopted for their respective sets of axioms.

We might also notice at this point a subtle difference between the primary arithmetic and the primary algebra with respect to the grounds of justification that we have naturally if tacitly adopted for their respective sets of axioms.

|}

|}

All of the axioms in this set have the form of equations.  This means that all of the inference steps that they allow are reversible.  The proof annotation scheme employed below makes use of a double bar <math>\overline{\underline{~~~~~~}}\!</math> to mark this fact, although it will often be left to the reader to decide which of the two possible directions is the one required for applying the indicated axiom.

All of the axioms in this set have the form of equations.  This means that all of the inference steps that they allow are reversible.  The proof annotation scheme employed below makes use of a double bar <math>=\!=\!=\!=\!=\!=</math> to mark this fact, although it will often be left to the reader to decide which of the two possible directions is the one required for applying the indicated axiom.

===Frequently used theorems===

===Frequently used theorems===

===Focal nodes===

===Focal nodes===

* [[Inquiry Live]]

* [[Inquiry Live]]

* [[Logic Live]]

* [[Logic Live]]

===Peer nodes===

===Peer nodes===

* [http://intersci.ss.uci.edu/wiki/index.php/Logical_graph Logical Graph @ InterSciWiki]

* [http://intersci.ss.uci.edu/wiki/index.php/Logical_graph Logical Graph @ InterSciWiki]

* [http://mywikibiz.com/Logical_graph Logical Graph @ MyWikiBiz]

* [http://mywikibiz.com/Logical_graph Logical Graph @ MyWikiBiz]

* [http://beta.wikiversity.org/wiki/Logical_graph Logical Graph @ Wikiversity Beta]

* [http://beta.wikiversity.org/wiki/Logical_graph Logical Graph @ Wikiversity Beta]

===Logical operators===

===Logical operators===

Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.

Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.

* [http://mywikibiz.com/Logical_graph Logical Graph], [http://mywikibiz.com/ MyWikiBiz]

* [http://mywikibiz.com/Logical_graph Logical Graph], [http://mywikibiz.com/ MyWikiBiz]

* [http://mathweb.org/wiki/Logical_graph Logical Graph], [http://mathweb.org/wiki/ MathWeb Wiki]

* [http://planetmath.org/LogicalGraphIntroduction Logical Graph 1], [http://planetmath.org/ PlanetMath]

* [http://planetmath.org/LogicalGraphFormalDevelopment Logical Graph 2], [http://planetmath.org/ PlanetMath]

* [http://semanticweb.org/wiki/Logical_graph Logical Graph], [http://semanticweb.org/ Semantic Web]

* [http://semanticweb.org/wiki/Logical_graph Logical Graph], [http://semanticweb.org/ Semantic Web]

* [http://wikinfo.org/w/index.php/Logical_graph Logical Graph], [http://wikinfo.org/w/ Wikinfo]

* [http://planetmath.org/LogicalGraphIntroduction Logical Graph 1], [http://planetmath.org/LogicalGraphFormalDevelopment Logical Graph 2], [http://planetmath.org/ PlanetMath]

* [http://en.wikiversity.org/wiki/Logical_graph Logical Graph], [http://en.wikiversity.org/ Wikiversity]

* [http://beta.wikiversity.org/wiki/Logical_graph Logical Graph], [http://beta.wikiversity.org/ Wikiversity Beta]

* [http://beta.wikiversity.org/wiki/Logical_graph Logical Graph], [http://beta.wikiversity.org/ Wikiversity Beta]

* [http://en.wikipedia.org/w/index.php?title=Logical_graph&oldid=67277491 Logical Graph], [http://en.wikipedia.org/ Wikipedia]

* [http://en.wikipedia.org/w/index.php?title=Logical_graph&oldid=67277491 Logical Graph], [http://en.wikipedia.org/ Wikipedia]

[[Category:Artificial Intelligence]]

[[Category:Artificial Intelligence]]