Search results

• Entitative graph
  An '''entitative [[graph (mathematics)|graph]]''' is an element of the [[graph theory|graphical]] [[syntax]] for [[logic]] that [[Charles ...Qualitative Logic", MS 736 (c. 1886), pp. 101–115 in ''The New Elements of Mathematics by Charles S. Peirce, Volume 4, Mathematical Philosophy'', [[Carolyn Eisele
  2 KB (200 words) - 14:26, 5 September 2017
• Directory:Encyclopedia Nova Caesarea
  ...rgone rapid expansion, with topics ranging from automobiles, to people, to mathematics. <!-- This line break means that the next element should appear below all other elements, regardless of alignment. -->
  2 KB (235 words) - 15:05, 23 August 2007
• Boolean function
  ...In the case where <math>k = 0,\!</math> the function is simply a constant element of <math>\mathbb{B}.</math> * [[Relation (mathematics)|Relation]]
  5 KB (589 words) - 20:24, 5 November 2015
• Boolean domain
  A '''boolean domain''' <math>\mathbb{B}</math> is a generic 2-element [[set]], say, <math>\mathbb{B} = \{ 0, 1 \},</math> whose elements are inte * [[Relation (mathematics)|Relation]]
  5 KB (561 words) - 19:54, 5 November 2015
• Sole sufficient operator
  ...> is an arbitrary set and where <math>\mathbb{B}\!</math> is a generic two-element set, typically <math>\mathbb{B} = \{ 0, 1 \} = \{ \mathrm{false}, \mathrm{t * [[Relation (mathematics)|Relation]]
  5 KB (626 words) - 18:07, 7 November 2015
• Triadic relation
  ...es up a pair of simple but instructive examples from each of the realms of mathematics and semiotics. ==Examples from mathematics==
  18 KB (2,519 words) - 18:02, 27 May 2020
• Graph theory
  : ''For an introduction to graph theory see [[Graph (mathematics)]]''. ...'''graph theory''' has for its subject matter the properties of ''[[graph (mathematics)|graphs]]''. Informally speaking, a graph is a set of objects called ''poi
  17 KB (2,473 words) - 11:44, 6 September 2007
• Ordinal number
  Here, we describe the [[mathematics|mathematical]] meaning of '''transfinite ordinal numbers'''. They were int ...keep this section intuitive and understandable with almost no knowledge of mathematics. -->
  29 KB (4,819 words) - 16:23, 9 January 2007
• Hypostatic abstraction
  '''Hypostatic abstraction''' is a formal operation that takes an element of information, as expressed in a proposition <math>X ~\text{is}~ Y,\!</mat ...ntroduced [[Charles Sanders Peirce]] (CP&nbsp;4.235, &ldquo;[[The Simplest Mathematics]]&rdquo; (1902), in ''Collected Papers'', CP&nbsp;4.227&ndash;323).
  7 KB (915 words) - 18:58, 10 November 2015
• User:Jon Awbrey/OLDSANDBOX
  ...laws in general it therefore suffices to understand them for just this two-element Boolean algebra. ...n''-ary operations ''f'':&nbsp;''X''^''n''&rarr;''X'' on a ''k''-element set ''X'', there are therefore 2²^{^''n''} ''n
  43 KB (6,715 words) - 13:25, 22 June 2009
• Relation reduction
  ...al reducibility''' have to do with the extent to which a given [[relation (mathematics)|relation]] is determined by a set of other relations, called the ''relatio ...for <math>(s, i),\!</math> tells us that <math>L\!</math> has just the one element <math>(o, s, i)\!</math> over each point of <math>S \times I.\!</math> All
  29 KB (4,035 words) - 03:32, 15 November 2015
• Relation (mathematics)
  In mathematics, a '''finitary relation''' is defined by one of the formal definitions give ...gned to deal with empirical data, and experience is always finite, whereas mathematics is nothing if not concerned with infinity, at the very least, potential inf
  20 KB (2,925 words) - 17:08, 14 November 2015
• Minimal negation operator
  ...oint of <math>\mathbb{B}^k~\!</math> is the unique point in the ''[[fiber (mathematics)|fiber]] of truth'' <math>[|s|]~\!</math> of a ''singular proposition'' <ma : A ''[[boolean domain]]'' <math>\mathbb{B}~\!</math> is a generic 2-element set, for example, <math>\mathbb{B} = \{ 0, 1 \},~\!</math> whose elements a
  23 KB (3,337 words) - 13:54, 3 September 2017
• Boolean algebras canonically defined
  ...et satisfying certain equations. Just as group theory deals with [[Group (mathematics)|groups]], and linear algebra with [[vector spaces]], so does Boolean algeb ...to mathematical logic, digital logic, and the set-theoretic foundations of mathematics, among other applications. Boolean algebra has a rich mathematical theory,
  46 KB (7,114 words) - 18:24, 2 October 2007
• Directory:Jon Awbrey/SANDBOX
  ...laws in general it therefore suffices to understand them for just this two-element Boolean algebra. ...n''-ary operations ''f'':&nbsp;''X''^''n''&rarr;''X'' on a ''k''-element set ''X'', there are therefore 2²^{^''n''} ''n
  46 KB (7,067 words) - 04:10, 22 May 2010
• Computer software
  ...n (mathematics)|relational]] form which translates into being the [[graph (mathematics)|map]] of a ''realization'' [[digital network|network]] (see [[VHDL]]). ...nclude simple operations such as incrementing the value of a variable data element. More complex computations may involve many operations and data elements t
  14 KB (2,076 words) - 13:33, 31 October 2012
• User:Jon Awbrey/DIFF/A
  ...e result, illustrated by means of a digraph picture, where the "no change" element (''dx'')(''dy'') is drawn as a loop at the point ''x y''. ...he relationship between the pragmatic maxim and what are commonly known in mathematics as ''representation principles''. As it turns out, with regard to its form
  112 KB (11,050 words) - 14:19, 22 May 2007
• Propositional calculus
  # Base. Any element of the alpha set <math>\Alpha\!</math> is a formula of <math>\mathcal{L}</m * [[Relation (mathematics)|Relation]]
  17 KB (2,301 words) - 15:56, 7 November 2015
• Relation composition
  '''Relation composition''', or the composition of [[relation (mathematics)|relations]], is the generalization of function composition, or the composi The first order of business is to define the operation on [[relation (mathematics)|relations]] that is variously known as the ''composition of relations'', '
  65 KB (6,802 words) - 18:14, 14 November 2015
• Directory:Jon Awbrey/Papers/Propositions As Types
  | '''IF''' we know that the element <math>x\!</math> is of the type <math>X\!</math> | '''THEN''' we know that the element <math>f(x)\!</math> is of the type <math>Y.\!</math>
  150 KB (9,422 words) - 23:54, 6 July 2013

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