Search results

• Logical NAND
  ...and only if both of its operands are true. In other words, it produces a value of ''true'' if and only if at least one of its operands is false. |+ style="height:30px" | <math>\text{Logical NAND}\!</math>
  5 KB (684 words) - 22:56, 4 November 2015
• Normative science
  ===Logical operators=== * [[Logical conjunction]]
  5 KB (568 words) - 16:10, 4 November 2020
• Boolean domain
  ...mathbb{B} = \{ 0, 1 \},</math> whose elements are interpreted as [[logical value]]s, typically, <math>0 = \operatorname{false}</math> and <math>1 = \operato A '''boolean variable''' <math>x\!</math> is a [[variable]] that takes its value from a boolean domain, as <math>x \in \mathbb{B}.</math>
  5 KB (561 words) - 19:54, 5 November 2015
• Logical negation
  ...osition, that produces a value of ''true'' when its operand is false and a value of ''false'' when its operand is true. |+ style="height:30px" | <math>\text{Logical Negation}\!</math>
  6 KB (729 words) - 14:16, 5 November 2015
• Parametric operator
  ===Logical operators=== * [[Logical conjunction]]
  5 KB (572 words) - 04:16, 7 November 2015
• Differential logic
  ...al system with the expressive capacity to describe change and diversity in logical universes of discourse. A simple example of a differential logical calculus is furnished by a [[differential propositional calculus]]. This a
  6 KB (662 words) - 22:28, 5 November 2015
• Sole sufficient operator
  ...a specified class of operators.&nbsp; In the context of [[logic]], it is a logical operator that suffices to generate every [[boolean-valued function]], <math ===Logical operators===
  5 KB (626 words) - 18:07, 7 November 2015
• Directory:Logic Museum/Corpus Thomisticum (website)
  ...tml Corpus Thomisticum] The works of St. [[Thomas Aquinas]], including the logical works attributed to him.
  183 bytes (24 words) - 14:43, 8 November 2009
• Boolean function
  ===Logical operators=== * [[Logical conjunction]]
  5 KB (589 words) - 20:24, 5 November 2015
• User:Jon Awbrey/SYLLABUS
  ===Logical operators=== * [[Logical conjunction]]
  6 KB (706 words) - 19:02, 9 June 2010
• Relative term
  A '''relative term''' is a logical term that requires reference to any number of other objects, called the ''c ===Logical operators===
  5 KB (599 words) - 20:20, 16 November 2015
• Relation construction
  ===Logical operators=== * [[Logical conjunction]]
  5 KB (621 words) - 19:18, 14 November 2015
• Multigrade operator
  ===Logical operators=== * [[Logical conjunction]]
  5 KB (618 words) - 04:12, 7 November 2015
• Exclusive disjunction
  ...logical values, typically the values of two propositions, that produces a value of ''true'' just in case exactly one of its operands is true. ===Logical operators===
  6 KB (728 words) - 01:45, 31 October 2015
• Universe of discourse
  ** [http://www.helsinki.fi/science/commens/terms/logicaluniv.html Logical Universe] ===Logical operators===
  6 KB (702 words) - 19:14, 7 November 2015
• Directory:Logic Museum/The Square of Opposition
  64 bytes (9 words) - 18:36, 13 October 2010
• Truth table
  ...>\{ \operatorname{false}, \operatorname{true} \}.</math> The names of the logical values, or ''truth values'', are commonly abbreviated in accord with the eq ==Logical negation==
  16 KB (2,190 words) - 03:25, 30 October 2015
• Boolean-valued function
  ...al language domain, if that is what is required to determine a final truth value. ===Logical operators===
  7 KB (806 words) - 21:14, 5 November 2015
• Logic of information
  ...development the concept of information serves to integrate the aspects of logical signs that are separately covered by the concepts of denotation and connota * Peirce, C.S. (1867), "Upon Logical Comprehension and Extension", [http://www.iupui.edu/~peirce/writings/v2/w2/
  8 KB (1,038 words) - 03:24, 16 November 2015
• Continuous predicate
  ...the whole I call a ''continuous predicate''.&nbsp; It is very important in logical analysis, because a continuous predicate obviously cannot be a ''compound'' ===Logical operators===
  8 KB (1,058 words) - 04:08, 10 November 2015

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