Search results

• Directory:Jon Awbrey/Papers/Dynamics And Logic
  ...things that you can do, once you have a moderately efficient calculus for boolean functions or propositional logic, whatever you choose to call it, is to sta The proposition <math>pq\!</math> may be taken as a boolean function <math>f(p, q)\!</math> having the abstract type <math>f : \mathbb{
  127 KB (18,875 words) - 13:28, 10 December 2014
• Directory:Jon Awbrey/Papers/Change In Logic
  extended set of boolean basis elements {u, v, w, du, dv, dw}. sense no different than other boolean variables, it usually
  73 KB (6,208 words) - 04:08, 11 December 2016
• Directory:Jon Awbrey/Papers/Differential Logic : Introduction
  ...ted by having a conceptually efficient calculus in place at the level of [[boolean-valued functions]] and elementary logical propositions. A calculus that is An efficient calculus for the realm of logic represented by boolean functions and elementary propositions makes it feasible to compute the fini
  131 KB (20,198 words) - 15:38, 2 December 2015
• Directory:Jon Awbrey/Papers/Differential Propositional Calculus
  | <math>\text{Boolean functions}\!</math> | <math>\text{Boolean functions on}~ \mathrm{d}A\!</math>
  158 KB (22,468 words) - 03:24, 27 December 2016
• User:Jon Awbrey/BIB
  * Peirce, C.S. (1885), "On the Algebra of Logic: A Contribution to the Philosophy of Notation", ''American Journa * Peirce, C.S. (1885), "On the Algebra of Logic: A Contribution to the Philosophy of Notation", ''American Journa
  61 KB (7,563 words) - 18:26, 15 June 2010
• Directory:Jon Awbrey/BIB
  * Peirce, C.S. (1885), "On the Algebra of Logic: A Contribution to the Philosophy of Notation", ''American Journa * Peirce, C.S. (1885), "On the Algebra of Logic: A Contribution to the Philosophy of Notation", ''American Journa
  61 KB (7,562 words) - 18:18, 18 March 2008
• Directory:Jon Awbrey/Papers/Differential Logic
  ...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 <math>xy\!</math> may be taken as a boolean function <math>f(x, y)\!</math> having the abstract type <math>f : \mathbb{
  145 KB (19,916 words) - 19:32, 11 December 2014
• User:Jon Awbrey/Differential Logic Archive 2002
  have a really decent calculus for boolean functions The proposition xy may be taken as a boolean function f(x, y)
  134 KB (14,931 words) - 13:30, 5 December 2014
• User:Jon Awbrey/THEORY
  * [[Boolean algebra]] * [[Boolean domain]]
  81 KB (11,851 words) - 18:53, 20 August 2007
• Directory:Jon Awbrey/THEORY
  * [[Boolean algebra]] * [[Boolean domain]]
  81 KB (11,851 words) - 22:22, 25 January 2008
• Directory:Jon Awbrey/Papers/Peirce's Logic Of Information
  ...''B''', where ''X'' is a suitable universe of discourse and '''B''' is the boolean domain {0, 1}. * [[Boolean algebra]]
  73 KB (8,310 words) - 00:36, 27 April 2017
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  ...lgebra, posted as a [http://mathoverflow.net/questions/9292/newbie-boolean-algebra-question problem for proof] at [http://mathoverflow.net/ MathOverFlow]. ...ple was known to Boole in the 1850's, tantamount to what we now call the ''boolean expansion'' of a propositional expression. The only novelty here resides i
  157 KB (17,761 words) - 03:44, 10 November 2016
• Directory:Jon Awbrey/Papers/Futures Of Logical Graphs
  :* Lou Kauffman, [http://www.math.uic.edu/~kauffman/Arithmetic.htm Box Algebra, Boundary Mathematics, Logic, and Laws of Form]. ...ic of any variety, germinated by their summarizations, are the root of all algebra.
  168 KB (21,027 words) - 12:41, 6 August 2017
• Inquiry
  ...example, in the realm of reasoning that is variously known as ''[[boolean algebra]]'', ''[[propositional logic|propositional calculus]]'', ''[[sentential cal * [[Boolean domain]]
  58 KB (7,676 words) - 22:34, 15 November 2015
• User:Jon Awbrey/PEIRCE
  How often do we think of the thing in algebra? When we use the symbol of multiplication we do not even think out the con
  74 KB (11,616 words) - 23:56, 21 May 2010
• Directory:Jon Awbrey/Papers/Differential Logic and Dynamic Systems 3.0
  ...ted by having a conceptually efficient calculus in place at the level of [[boolean-valued functions]] and elementary logical propositions. A calculus that is ...s any mathematician with a sensitivity to the ring and field properties of algebra would do:
  519 KB (74,456 words) - 15:46, 3 October 2013
• Directory:Jon Awbrey/Differential Logic : Various Sketches
  * The boolean domain is a set of two elements, <math>\mathbb{B} = \{ 0, 1 \},</math> repr ...differential variables are in some abstract sense no different than other boolean variables, it usually helps to mark their distinctive roles and their diffe
  369 KB (46,156 words) - 04:20, 27 December 2016
• User:Jon Awbrey/EXIT
  | align="right" | 15 || [[Relational algebra]] | align="right" | 13 || [[Boolean function]]
  147 KB (23,399 words) - 12:51, 20 August 2007
• Charles Sanders Peirce
  How often do we think of the thing in algebra? When we use the symbol of multiplication we do not even think out the con
  93 KB (14,277 words) - 20:00, 28 July 2017
• Directory:Jon Awbrey/Papers/Cactus Language
  Another set of indications appears in algebra and category theory, where forms of composition and decomposition related t .... The logical denotation of either a blank symbol or an empty node is the boolean value <math>\underline{1} = \operatorname{true}.</math> The logical denota
  211 KB (31,551 words) - 20:44, 2 August 2017

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