Search results

• User:Jon Awbrey/SANDBOX
  | align="center" | <math>\xrightarrow{\operatorname{Parse}}</math> | width="33%" | <math>\text{Graph in PARC}\!</math>
  21 KB (2,298 words) - 13:50, 24 April 2009
• Directory:Jon Awbrey/Papers/Propositions As Types
  Consider the parse tree of the term <math>\operatorname{I}</math> in terms of the primitive co ..., and to carry along the type information as we go, ending up with a typed parse tree for <math>\operatorname{I},</math> tantamount to a proof tree for <mat
  150 KB (9,422 words) - 23:54, 6 July 2013
• Talk:Logical graph
  See [[Logical_graph#C2._Generation_theorem|Logical Graph : C₂. Generation Theorem]]. This corresponds to an unlabeled terminal node in a logical graph. When we are thinking of it by itself, we draw it as a rooted node:
  62 KB (8,262 words) - 12:46, 14 December 2008
• Propositional calculus
  : ''Main article'' : [[Logical graph]] ...s to strings is achieved by an operation that is called ''traversing'' the graph.
  17 KB (2,301 words) - 15:56, 7 November 2015
• Directory talk:Jon Awbrey/Papers/Differential Logic : Introduction
  | <math>\text{Cactus Graph}\!</math> | <math>\text{Cactus Graph}\!</math>
  26 KB (3,309 words) - 18:38, 2 December 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
• Module:Graph
  -- ATTENTION: Please edit this code at https://de.wikipedia.org/wiki/Modul:Graph ...el format bug? (xAxisFormat =) https://en.wikipedia.org/wiki/Template_talk:Graph:Chart#X-Axis_label_format_bug?_(xAxisFormat_=)
  43 KB (5,442 words) - 21:53, 15 July 2021
• 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
• Module:Excerpt/portals
  "[Tt]elevision[ _]ratings[ _]graph" local ranges = mw.text.split(str, ",") -- parse ranges: "1,3-5" to {"1","3-5"}
  48 KB (7,371 words) - 21:29, 15 July 2021
• Directory:Jon Awbrey/Papers/Cactus Rules
  Here are the parse-graph portraits of the family of cacti The parse-graph of (p (q)) is a particular type of tree,
  343 KB (13,950 words) - 02:46, 23 May 2009
• Directory:Jon Awbrey/Papers/Functional Logic : Quantification Theory
  ...parse into data structures whose underlying graphs are called ''cacti'' by graph theorists. Hence the name ''[[cactus language]]'' for this dialect of prop [[Category:Graph Theory]]
  81 KB (10,378 words) - 02:22, 5 July 2013
• Directory:Jon Awbrey/Papers/Functional Logic : Higher Order Propositions
  ...parse into data structures whose underlying graphs are called ''cacti'' by graph theorists. Hence the name ''[[cactus language]]'' for this dialect of prop [[Category:Graph Theory]]
  105 KB (15,890 words) - 03:12, 4 July 2013
• Directory:Jon Awbrey/Papers/Futures Of Logical Graphs
  ...paper bridges that Peirce used to augment his genus, can be represented as parse-strings in Ascii and sculpted into pointer-structures in computer memory. ...riginal graph correspond to edges (or lines) between the nodes of the dual graph.
  168 KB (21,027 words) - 12:41, 6 August 2017
• 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 talk:Jon Awbrey/Papers/Cactus Language
  ...nts from previous discussions that I plan to use in documenting the cactus graph syntax for propositional logic.'' The cactus graph and the cactus expression shown here are both described as a ''spike''.
  191 KB (21,069 words) - 21:01, 29 June 2009
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  The existential graph representation of Peirce's law is shown below. ..., the praeclarum theorema is represented by means of the following logical graph.
  157 KB (17,761 words) - 03:44, 10 November 2016
• Inquiry
  ...se of his [[logical graph]]s, taken at the level of his so-called '[[alpha graph]]s'. ...reasoning. Peirce would pick up the story at this juncture and eventually parse analogy in a couple of different ways, both of them involving all three typ
  58 KB (7,676 words) - 22:34, 15 November 2015
• Directory:Jon Awbrey/Papers/Functional Logic : Inquiry and Analogy
  ...parse into data structures whose underlying graphs are called ''cacti'' by graph theorists. Hence the name ''[[cactus language]]'' for this dialect of prop [[Category:Graph Theory]]
  106 KB (13,991 words) - 18:45, 18 March 2020
• User:Badmachine/wikipedia-en-2013-05-06
  ...think of the fact that i made the career timeline into both a table and a graph? https://en.wikipedia.org/wiki/Walfredo_Reyes,_Jr.#Career ...ownside to my arrangement of a table and a graph side by side, is that the graph isn't very readable on a phone. oh well!
  132 KB (19,574 words) - 21:50, 23 January 2015

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