In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation...

typography. It has many names, often related to particular meanings: Sheffer stroke (in logic), pipe, bar, or (literally, the word "or"), vbar, and others...

the logical NAND, usually symbolized with a vertical line called the Sheffer stroke, or its dual logical NOR (usually symbolized with a vertical arrow or...

very large integers ↑, a mathematical game theory position Up ↑ or Sheffer stroke, the logical connective "not both" or NAND ↑, the APL function 'take'...

\operatorname {NOR} } . As with its dual, the NAND operator (also known as the Sheffer stroke—symbolized as either ↑ {\displaystyle \uparrow } , ∣ {\displaystyle...

introduction of the Sheffer stroke ("|") to symbolise "incompatibility" (i.e., if both elementary propositions p and q are true, their "stroke" p | q is false)...

recommended instead. [by whom?] ↑ | U+2191 U+007C upwards arrow vertical line Sheffer stroke, the sign for the NAND operator (negation of conjunction). ↓ U+2193...

gates using NOR logic. Boolean algebra Flash memory Logic gate symbols Sheffer stroke Mano, M. Morris and Charles R. Kime. Logic and Computer Design Fundamentals...

known as the Sheffer stroke). It is one of 25 candidate axioms for this property identified by Stephen Wolfram, by enumerating the Sheffer identities of...

structures and chip deposition geometries that produce NAND logic elements Sheffer stroke – other name NOR logic – like NAND gates, NOR gates are also universal...

expressed using quantifiers. Additional logical connectives such as the Sheffer stroke, Dpq (NAND), and exclusive or, Jpq. Non-logical symbols represent predicates...

{\displaystyle {\frac {A,\neg \left(A\wedge \neg B\right)}{B}}} Because Sheffer's stroke (also known as NAND operator) is functionally complete, it can be used...

{\displaystyle A} ∴ ¬ B {\displaystyle \therefore \neg B} Based on the Sheffer Stroke (alternative denial), "|", the inference can also be formalized in this...

first published proof was by Henry M. Sheffer in 1913, so the NAND logical operation is sometimes called Sheffer stroke; the logical NOR is sometimes called...

first published proof was by Henry M. Sheffer in 1913, so the NAND logical operation is sometimes called Sheffer stroke; the logical NOR is sometimes called...

terms of a sole sufficient operator such as the Peirce arrow (NOR) or Sheffer stroke (NAND). Similarly, in classical first-order logic, one of the quantifiers...

Wittgenstein's N-operator is a broader infinitary analogue of the Sheffer stroke, which applied to a set of propositions produces a proposition that...

{\displaystyle \to } (if...then), and ↑ {\displaystyle \uparrow } (Sheffer stroke). Given the conditional proposition p → q {\displaystyle p\to q} , one...

first published proof was by Henry M. Sheffer in 1913, so the NAND logical operation is sometimes called Sheffer stroke; the logical NOR is sometimes called...

equations yet further; for instance, with the vertical bar representing the Sheffer stroke operation, the single axiom ( ( a ∣ b ) ∣ c ) ∣ ( a ∣ ( ( a ∣ c ) ∣...

Minimal axioms for Boolean algebra Peirce arrow Read-once function Sheffer stroke Sole sufficient operator Symmetric Boolean function Symmetric difference...

of its inputs is true and the other is false ("not equal") NAND or Sheffer stroke - true when it is not the case that all inputs are true ("not both")...

first published proof was by Henry M. Sheffer in 1913, so the NAND logical operation is sometimes called Sheffer stroke; the logical NOR is sometimes called...

negation, or even using only a single connective for "not and" (the Sheffer stroke), as Jean Nicod did. A joint denial connective (logical NOR) will also...

same cardinality stretch A convex subclass of an ordered class stroke The Sheffer stroke (only used in the second edition of PM) type As in type theory...

innovations are introduced. For Quine, there is but one connective, the Sheffer stroke, and one quantifier, the universal quantifier. All polyadic predicates...

¬q, Negation; 6, XOR, Exclusive disjunction; 7, NAND, Logical NAND (Sheffer stroke); 8, AND, Logical conjunction; 9, XNOR, If and only if, Logical biconditional;...

clearly defined, often discussed in the context of semantic vagueness. Sheffer stroke A logical operation equivalent to the nand (not and) function; it is...

as well. In his 4.3 through 5.101, Wittgenstein adopts an unbounded Sheffer stroke as his fundamental logical entity and then lists all 16 functions of...

logic -- Set (mathematics) -- Seven Types of Ambiguity (Empson) -- Sheffer stroke -- Ship of Theseus -- Simple non-inferential passage -- Singular term...