Search results

• User:Jon Awbrey/HISTORY
  ===Aug — Extensions Of Logical Graphs=== ===Jul — Reflective Extension Of Logical Graphs===
  7 KB (890 words) - 14:20, 12 June 2009
• Directory:Jon Awbrey/Projects/Logic Of Information
  * [[Directory:Jon Awbrey/Papers/Futures Of Logical Graphs|Futures Of Logical Graphs]] * [[Laws of Form]]
  2 KB (182 words) - 04:04, 19 June 2007
• Directory talk:Jon Awbrey/Papers/Dynamics And Logic
  ===May 2005 — Qualitative Logic, Logical Graphs, Laws Of Form===
  3 KB (305 words) - 14:50, 12 June 2009
• Descriptive science
  A '''descriptive science''', also called a '''special science''', is a form of [[inquiry]], typically involving a community of inquiry and its accumula ===Logical operators===
  5 KB (556 words) - 16:15, 4 November 2020
• Normative science
  A '''normative science''' is a form of [[inquiry]], typically involving a community of inquiry and its accumula ===Logical operators===
  5 KB (568 words) - 16:10, 4 November 2020
• Boolean function
  ...nitary boolean function''' is a [[function (mathematics)|function]] of the form <math>f : \mathbb{B}^k \to \mathbb{B},</math> where <math>\mathbb{B} = \{ 0 ===Logical operators===
  5 KB (589 words) - 20:24, 5 November 2015
• Directory talk:Jon Awbrey/Papers/Differential Logic and Dynamic Systems 3.0
  ...oth conceptual and computational standpoints is based on just two types of logical connectives, both of variable <math>k\!</math>-ary scope. The formulas of ...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
  8 KB (1,204 words) - 02:22, 12 July 2009
• Continuous predicate
  ...nection between the different subjects as expressed in the propositional ''form''.&nbsp; What I mean by &ldquo;everything that can be removed from the pred ...ose we attempt to remove more from the predicate and put the last into the form &ldquo;&mdash; exercises the function of relate of the relation &mdash; to
  8 KB (1,058 words) - 04:08, 10 November 2015
• Truth table
  ...>\{ \operatorname{false}, \operatorname{true} \}.</math> The names of the logical values, or ''truth values'', are commonly abbreviated in accord with the eq ...ent a truth function by a [[boolean function]], that is, a function of the form <math>f : \mathbb{B}^k \to \mathbb{B},</math> where <math>k\!</math> is a n
  16 KB (2,190 words) - 03:25, 30 October 2015
• Square of opposition
  Every categorical proposition can be reduced to one of four logical forms. These are: ...roposition, the universal affirmative (''universalis affirmativa''), whose form in Latin is 'omne S est P', usually translated as 'every S is P'.
  9 KB (1,495 words) - 09:18, 19 January 2010
• Peirce's law
  ...in [[propositional calculus]] that is commonly expressed in the following form: ...eirce's law is represented by means of the following formal equivalence or logical equation.
  11 KB (1,526 words) - 04:14, 18 November 2015
• Logical implication
  ...mpasses a specific logical [[function (mathematics)|function]], a specific logical [[relation (mathematics)|relation]], and the various symbols that are used Close approximations to the concept of logical implication are expressed in ordinary language by means of linguistic forms
  16 KB (2,147 words) - 20:18, 4 November 2015
• Pragmaticism
  Pragmaticism was originally enounced² in the form of a [[maxim]], as follows: Consider what effects that might ''conceivably * [[Logical graph]]
  2 KB (254 words) - 04:12, 24 January 2008
• Directory talk:Jon Awbrey/Papers/Differential Logic and Dynamic Systems 2.0
  ...esponding to the alphabet <math>\mathfrak{A}</math> there is then a set of logical features, <math>\mathcal{A} = \{ a_1, \ldots, a_n \}.</math> A set of logical features, <math>\mathcal{A} = \{ a_1, \ldots, a_n \},</math> affords a basi
  23 KB (3,495 words) - 01:32, 14 July 2008
• Zeroth order logic
  ...es underlying the algebra of sets, boolean algebra, [[boolean functions]], logical connectives, monadic predicate calculus, [[propositional calculus]], and se ...''(0,0)). Such a sequence, perhaps in another order, and perhaps with the logical values ''F'' and ''T'' instead of the boolean values 0 and 1, respectively,
  10 KB (1,357 words) - 16:04, 8 November 2015
• Semeiotic
  ...ons]], along with ''semiotic'' and the plural variants of both terms. The form ''semeiotic'' is often used to distinguish Peirce's theory, since it is les ===Logical operators===
  9 KB (1,162 words) - 20:54, 3 November 2015
• Talk:Logical graph
  ==Logical Equivalence Problem== ...spa?messageID=6514666 Solution posted by Jon Awbrey, using the calculus of logical graphs].
  62 KB (8,262 words) - 12:46, 14 December 2008
• Talk:Zeroth order logic
  ...es underlying the algebra of sets, boolean algebra, [[boolean functions]], logical connectives, monadic predicate calculus, [[propositional calculus]], and se ...''(0,0)). Such a sequence, perhaps in another order, and perhaps with the logical values ''F'' and ''T'' instead of the boolean values 0 and 1, respectively,
  11 KB (1,562 words) - 03:04, 9 November 2015
• Pragmatic maxim
  * The first excerpt appears in the form of a dictionary entry, intended as a definition of ''pragmatism''. Pragmaticism was originally enounced in the form of a maxim, as follows: Consider what effects that might ''conceivably'' h
  12 KB (1,764 words) - 04:32, 17 November 2015
• Entitative graph
  * [[Laws of Form]] * [[Logical graph]]
  2 KB (200 words) - 14:26, 5 September 2017

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