Search results

• Directory:Jon Awbrey/Projects/Logic Of Information
  * [[Boolean algebra]] * [[Boolean domain]]
  2 KB (182 words) - 04:04, 19 June 2007
• Logic Syllabus
  * [[Boolean domain]] * [[Boolean function]]
  3 KB (346 words) - 18:30, 27 May 2020
• User:Jon Awbrey/WORKSPACE
  * [[Boolean algebra]]
  2 KB (192 words) - 04:54, 7 March 2011
• Zeroth order logic
  ...e the common principles underlying the algebra of sets, boolean algebra, [[boolean functions]], logical connectives, monadic predicate calculus, [[proposition These six languages for the sixteen boolean functions are conveniently described in the following order:
  10 KB (1,357 words) - 16:04, 8 November 2015
• User:Jon Awbrey/OLDSANDBOX
  ...it therefore suffices to understand them for just this two-element Boolean algebra. ...ist the smaller arities first. This then makes the signature of a Boolean algebra
  43 KB (6,715 words) - 13:25, 22 June 2009
• Boolean algebras canonically defined
  :''Boolean algebras have been formally defined variously as a kind of lattice and as a ...and linear algebra with [[vector spaces]], so does Boolean algebra treat [[Boolean algebras]] as the models of the equational theory of two values.
  46 KB (7,114 words) - 18:24, 2 October 2007
• User:Jon Awbrey/MOF
  ...lgebra, posted as a [http://mathoverflow.net/questions/9292/newbie-boolean-algebra-question problem for proof] at [http://mathoverflow.net/ MathOverFlow].
  4 KB (529 words) - 02:30, 18 March 2010
• Triadic relation
  ...ower <math>\mathbb{B} \times \mathbb{B} \times \mathbb{B}</math> or the <i>boolean cube</i> <math>\mathbb{B}^3.</math> ...te either the boolean operation of <i>[[exclusive disjunction]]</i> or the boolean relation of <i>logical inequality</i>.
  18 KB (2,519 words) - 18:02, 27 May 2020
• Directory:Jon Awbrey/SANDBOX
  ...it therefore suffices to understand them for just this two-element Boolean algebra. ...ist the smaller arities first. This then makes the signature of a Boolean algebra
  46 KB (7,067 words) - 04:10, 22 May 2010
• Directory:UMBRELLA Consulting
  ...values between two variables in a mathematical way using a classic Boolean algebra law without the need of a buffer! The advantages of this technique is speed
  6 KB (907 words) - 10:21, 10 June 2009
• User:Jon Awbrey/ARCHIVE
  # [[Boolean domain]] # [[Boolean-valued function]]
  39 KB (4,682 words) - 14:55, 21 May 2007
• Peirce's law
  * [[Charles Sanders Peirce|Peirce, Charles Sanders]] (1885), "On the Algebra of Logic : A Contribution to the Philosophy of Notation", ''American Journa * [[Boolean domain]]
  11 KB (1,526 words) - 04:14, 18 November 2015
• User:Jon Awbrey/TABLE
  Table A1 lists equivalent expressions for the Boolean functions of two variables in a number of different notational systems. Table A2 lists the sixteen Boolean functions of two variables in a different order, grouping them by structura
  396 KB (47,606 words) - 03:22, 26 April 2012
• Logical graph
  ...ormalisms whose syntactic structures are isomorphic from the standpoint of algebra or topology are not recognized as being different from each other in any si ===Primary algebra as pattern calculus===
  41 KB (5,845 words) - 14:26, 6 November 2015
• User:Roygbiv/Graph
  ...sms whose syntactic structures are [[isomorphic]] from the standpoint of [[algebra]] or [[topology]] are not recognized as being different from each other in ===Primary algebra as pattern calculus===
  42 KB (5,905 words) - 21:49, 22 May 2010
• User:Jon Awbrey/DIFF/A
  ...e first things that you can do, once you have a really decent calculus for boolean functions or propositional logic, whatever you want to call it, is to compu The proposition ''xy'' may be taken as a boolean function ''f''(''x'',&nbsp;''y'') having the abstract type ''f''&nbsp;:&nbs
  112 KB (11,050 words) - 14:19, 22 May 2007
• Relation composition
  ...composition and ordinary [[matrix multiplication]] as it appears in linear algebra. ...tors <math>G_{ij}\!</math> and <math>H_{ij}\!</math> are values in the ''[[boolean domain]]'' <math>\mathbb{B} = \{ 0, 1 \}~\!</math> that are called the ''co
  65 KB (6,802 words) - 18:14, 14 November 2015
• Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata
  ...the cactus language for the tasks that are usually associated with boolean algebra and propositional calculus makes it possible to entertain a further extensi ...hat is known by the name of its state space <math>X\!</math> and we have a boolean state variable <math>x : X \to \mathbb{B},\!</math> where <math>\mathbb{B}
  134 KB (16,535 words) - 15:30, 11 October 2013
• Directory:Jon Awbrey/Papers/Cactus Rules
  in effect, just the boolean functions of abstract type q : B^3 -> B, boolean maps of the concrete shape [p, q, r] -> [q],
  343 KB (13,950 words) - 02:46, 23 May 2009
• Relation theory
  ...om, though closely related to, its study from the perspectives of abstract algebra on the one hand and formal logic on the other. * [[Boolean domain]]
  25 KB (3,665 words) - 21:04, 16 November 2015

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