Search results

MyWikiBiz, Author Your Legacy — Saturday April 27, 2024
Jump to navigationJump to search
Results 1 – 20 of 20
Advanced search

Search in namespaces:

  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  • ...makes any sense, but I think this time I'll just jump in, and show you the form in which this idea first came to me. Start with a proposition of the form ''x'' & ''y'', which I graph as two labels attached to a root node, so:
    112 KB (11,050 words) - 14:19, 22 May 2007
  • # [[Laws of Form]] | align="right" | 12 || [[Laws of Form]]
    39 KB (4,682 words) - 14:55, 21 May 2007
  • For example, consider an equation of the following form: ...edded and topological dual forms of the axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(} ~ \texttt{)(} ~ \texttt{)} =
    168 KB (21,027 words) - 12:41, 6 August 2017
  • ...in other words, that their [[minimal negation]] is true. A clause of this form maps into a PARC structure called a ''lobe'', in this case, one that is ''p ...other words, that their [[logical conjunction]] is true. A clause of this form maps into a PARC structure called a ''node'', in this case, one that is ''p
    131 KB (20,198 words) - 15:38, 2 December 2015
  • you the form in which this idea first came to me. Start with a proposition of the form x & y, which
    134 KB (14,931 words) - 13:30, 5 December 2014
  • Let us start with a proposition of the form <math>p ~\operatorname{and}~ q</math> that is graphed as two labels attache ...of exclusive disjunction, which parses to a cactus graph of the following form:
    127 KB (18,875 words) - 13:28, 10 December 2014
  • ...ulus of indications'' that George Spencer Brown presented in his ''Laws of Form''. ...om Peirce's &ldquo;[[Logical Graphs]]&rdquo; via Spencer-Brown's ''Laws of Form'' (LOF). In formal proofs, we use a variation of the annotation scheme fro
    157 KB (17,761 words) - 03:44, 10 November 2016
  • programming. I will attempt to embody this project in the form In their underlying form and tone these questions sound a familiar tune.
    162 KB (25,941 words) - 13:28, 9 January 2008
  • ...in other words, that their [[minimal negation]] is true. A clause of this form maps into a PARC structure called a ''lobe'', in this case, one that is ''p ...other words, that their [[logical conjunction]] is true. A clause of this form maps into a PARC structure called a ''node'', in this case, one that is ''p
    519 KB (74,456 words) - 15:46, 3 October 2013
  • ...hether in ontogeny or in phylogeny, that is, the two developments probably form parallel sides of a single bootstrap. But this is not always the easiest w ...to their elementary signs, and that can be strung together in sequences to form complex signs. Signs that have signs as their objects are called ''higher
    211 KB (31,551 words) - 20:44, 2 August 2017
  • ...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 This is yet another variant of the previous form, with <math>\mathrm{d}x</math> denoting small changes contemplated in <math
    369 KB (46,156 words) - 04:20, 27 December 2016
  • # For the other, I use a bracket of the form (&nbsp;,&nbsp;,&nbsp;,&nbsp;) as a connective which says that exactly one o ...d for both human and machine parsers. In the present text I preserve this form of expression in tables and set-off displays, but in contexts where parenth
    394 KB (54,134 words) - 14:30, 3 March 2023
  • | This indicates, conversely, how algebraic identities | Functors were first explicitly recognized in algebraic topology,
    567 KB (86,909 words) - 21:00, 6 December 2016
  • * A bracketed list of propositional expressions in the form <math>\texttt{(} e_1, e_2, \ldots, e_{k-1}, e_k \texttt{)}</math> indicates * A concatenation of propositional expressions in the form <math>e_1 ~ e_2 ~ \ldots ~ e_{k-1} ~ e_k</math> indicates that all of the p
    528 KB (75,728 words) - 21:56, 14 January 2021
  • * A bracketed list of propositional expressions in the form <math>\texttt{(} e_1, e_2, \ldots, e_{k-1}, e_k \texttt{)}\!</math> indicat * A concatenation of propositional expressions in the form <math>e_1 ~ e_2 ~ \ldots ~ e_{k-1} ~ e_k</math> indicates that all of the p
    529 KB (75,750 words) - 14:32, 3 March 2023
  • ...niques of logic programming. I will attempt to embody this project in the form of computer-implemented connections between geometric dynamics and logical In their underlying form and tone these questions sound a familiar tune. Their basic tenor was brou
    226 KB (34,541 words) - 14:20, 20 August 2016
  • ...vancing hedge of [[WP:NOR]] and because it has recently been cast into the form of an explicit notice appended beneath the edit window for New Article Crea ...editors are unblocked early after a 3RR 24 hr block. You were clearly by normal standards given the benefit of the doubt regarding whether it was serious m
    147 KB (23,399 words) - 12:51, 20 August 2007
  • you the form in which this idea first came to me. Start with a proposition of the form x & y, which
    899 KB (89,922 words) - 19:22, 6 December 2014
  • ...})\!</math> and <math>L(\text{B}),\!</math> but intended more generally to form a fully-developed environment of objective and interpretive resources, in t ...e applied to an illustrative exercise, roughing out the shape of a complex form of interpreter.
    725 KB (109,715 words) - 18:09, 28 August 2014
  • and the descriptions that they express in the form of computational form of effective computer programs. The most critical and toughest
    665 KB (109,541 words) - 02:46, 13 September 2010