#LogicalGraphs • 14
• https://oeis.org/w/index.php?title=Logical_Graphs&stable=0&redirect=no#Duality
#Duality • Logical and Topological
The procedure just described is called “traversing” the tree and the string read off is called the “#TraversalString” of the tree. The reverse operation of going from the string to the tree is called “parsing” the string and the tree constructed is called the “ParseGraph” of the string.
#Logic #Peirce #SpencerBrown #LawsOfForm
#PropositionalCalculus #BooleanFunctions
#GraphTheory #ModelTheory #ProofTheory
#ProofTheory #modeltheory #graphtheory #BooleanFunctions #PropositionalCalculus #lawsofform #spencerbrown #Peirce #logic #traversalstring #duality #LogicalGraphs
#ThemeOneProgram • #JetsAndSharks 1.4
• https://inquiryintoinquiry.com/2022/08/25/theme-one-program-jets-and-sharks-1/
Displayed below is the text expression of a #TraversalString which Theme One parses into a #CactusGraph #DataStructure in computer memory. The cactus graph represents a single #LogicalFormula in #PropositionalCalculus and this proposition embodies all the #LogicalConstraints defining the Jets and Sharks #DataBase.
#Logic #LogicalGraphs #Peirce
#CactusSyntax #LogicalCacti
#MinimalNegationOperators
#MinimalNegationOperators #logicalcacti #cactussyntax #Peirce #LogicalGraphs #logic #database #logicalconstraints #PropositionalCalculus #logicalformula #datastructure #cactusgraph #traversalstring #JetsAndSharks #ThemeOneProgram