Search results

• Graph theory
  : ''For an introduction to graph theory see [[Graph (mathematics)]]''. ...e from point ''B'' to point ''A''. In a ''digraph'', short for ''directed graph'', the two directions are counted as being distinct ''arcs'' or ''directed
  17 KB (2,473 words) - 11:44, 6 September 2007
• User:Jon Awbrey/ARCHIVE
  ===Semiotic Theory Of Information=== * Project Page : [[Semiotic Theory Of Information]]
  39 KB (4,682 words) - 14:55, 21 May 2007
• Relation composition
  ...rdquo; approach to relations that is outlined in the article on [[relation theory]]. ...ms, in set theories of various kinds, and through a broadening of category theory from functions to relations in general.
  65 KB (6,802 words) - 18:14, 14 November 2015
• User:Roygbiv/Graph
  A '''logical graph''' is a [[graph theory|graph-theoretic]] structure in one of the systems of graphical [[syntax]] that [h ...aph]]s'', Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.
  42 KB (5,905 words) - 21:49, 22 May 2010
• Logical graph
  A '''logical graph''' is a graph-theoretic structure in one of the systems of graphical syntax that Charles ...graphs'', Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.
  41 KB (5,845 words) - 14:26, 6 November 2015
• User:Jon Awbrey/DIFF/A
  Start with a proposition of the form ''x'' & ''y'', which I graph as two labels attached to a root node, so: ...in '''B''', and thus corresponds to an exclusive-or in logic, parses to a graph of the following form:
  112 KB (11,050 words) - 14:19, 22 May 2007
• Directory:Jon Awbrey/Papers/Theme One Program : Exposition
  of graph-theoretical data structures in memory, structures that have been graph-theoretical data structures that are used by the program,
  94 KB (8,938 words) - 22:12, 9 December 2015
• Minimal negation operator
  The remainder of this discussion proceeds on the algebraic convention that the plus sign <math>(+)~\!</math> and the summation symbol * [[Logical graph]]
  23 KB (3,337 words) - 13:54, 3 September 2017
• Directory:Jon Awbrey/Papers/Differential Propositional Calculus
  ...xclusive disjunction]]. For example, we have the following paraphrases of algebraic expressions: Table A8 expands the differential forms that result over an ''algebraic basis'':
  158 KB (22,468 words) - 03:24, 27 December 2016
• Directory:Jon Awbrey/Papers/Differential Logic : Introduction
  ...k\!</math>-ary scope. The formulas of this calculus map into a species of graph-theoretical structures called ''painted and rooted cacti'' (PARCs) that len | [[Image:Cactus Graph Lobe Connective.jpg|500px]]
  131 KB (20,198 words) - 15:38, 2 December 2015
• Directory:Jon Awbrey/Papers/Dynamics And Logic
  | [[Image:Cactus Graph Existential P And Q.jpg|500px]] | [[Image:Cactus Graph Existential True.jpg|500px]]
  127 KB (18,875 words) - 13:28, 10 December 2014
• Directory:Jon Awbrey/Papers/Futures Of Logical Graphs
  ...riginal graph correspond to edges (or lines) between the nodes of the dual graph. ...ngled out for special consideration and the corresponding node of the dual graph is referred to as its ''root node''.&nbsp; By way of graphical convention i
  168 KB (21,027 words) - 12:41, 6 August 2017
• User:Jon Awbrey/Differential Logic Archive 2002
  I graph as two labels attached to a root node, so: in logic, parses to a graph of the following form:
  134 KB (14,931 words) - 13:30, 5 December 2014
• Directory:Jon Awbrey/Papers/Differential Logic
  ...s corresponds to the exclusive disjunction operation in logic, parses to a graph of the following form: ...ath> for <math>x\!</math> and <math>1\!</math> for <math>y\!</math> in the graph amounts to the same thing as erasing those labels:
  145 KB (19,916 words) - 19:32, 11 December 2014
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  ...rithmetic initials'', <math>I_1\!</math> and <math>I_2,\!</math> and the ''algebraic initials'', <math>J_1\!</math> and <math>J_2.\!</math> The existential graph representation of Peirce's law is shown below.
  157 KB (17,761 words) - 03:44, 10 November 2016
• User:Jon Awbrey/Mathematical Notes
  : [[User:Jon Awbrey/Mathematical Notes#CAT. Category Theory|CAT. Category Theory]] : [[User:Jon Awbrey/Mathematical Notes#GRAPH. Graph Theory|GRAPH. Graph Theory]]
  567 KB (86,909 words) - 21:00, 6 December 2016
• Directory:Jon Awbrey/Papers/Cactus Language
  ...f tree-like data structures called ''painted cacti''. This is a family of graph-theoretic data structures that can be observed to have especially nice prop ...egard to their abstract structures as graphs, there are several species of graph-theoretic data structures that can be used to accomplish this job in a reas
  211 KB (31,551 words) - 20:44, 2 August 2017
• Directory:Jon Awbrey/Differential Logic : Various Sketches
  ...th>\mathrm{false}</math> and represented by the lighter shading, while the algebraic value 1 is interpreted as the logical value <math>\mathrm{true}</math> and ====Linear Topics : The Differential Theory of Qualitative Equations====
  369 KB (46,156 words) - 04:20, 27 December 2016
• Directory:Jon Awbrey/Papers/Differential Logic and Dynamic Systems 3.0
  ...k\!</math>-ary scope. The formulas of this calculus map into a species of graph-theoretical structures called ''painted and rooted cacti'' (PARCs) that len | [[Image:Cactus Graph Lobe Connective.jpg|500px]]
  519 KB (74,456 words) - 15:46, 3 October 2013
• User:Jon Awbrey/PROSPECT
  of systems theory and artificial intelligence to each other. in systems theory, working to extend its concepts and methods
  162 KB (25,941 words) - 13:28, 9 January 2008

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)