英語でSHEFFER'S STROKEはどんな意味ですか？
シェファーストローク
ブール関数と命題計算では、Henry M. Sheffer、 ""、 "Dpq"、または "↑"と書かれたShefferストロークは、通常の言語で表現された結合演算の否定と同等の論理演算を表します 両方ともではない。 実際には少なくともそのオペランドの1つが偽であると言われているので、これはnandまたは代替否定とも呼ばれます。 ブール代数およびデジタルエレクトロニクスでは、NAND演算として知られています。 その二重のNOR演算子のように、NANDは他の論理演算子を使用することなく、それ自体で論理正式システムを構成するために使用できます。 この特性は、NANDフラッシュメモリおよびコンピュータプロセッサ設計におけるその使用を含む、最新のデジタルエレクトロニクスにとってNANDゲートを重要なものにする。
英語辞典でのSheffer's strokeの定義
辞書中のShefferのストロークの定義は、2つの文の関数であり、それらの連合詞の否定に相当し、p | qここで、p、qは引数です。 qは、p、qが両方とも真であるときだけ偽である。 これだけですべての真理関数を構築することは可能です。
«SHEFFER'S STROKE»に関連する英語の本
以下の図書目録から
Sheffer's strokeの使いかたを見つけましょう。
Sheffer's strokeに関する本と英語文献で使われた文脈を提供するための簡単な抜粋文。
1
Mathematical Excursions, Enhanced Edition
TABLE 3.13 Sheffer's Stroke p p q q T T F T F T F T T F F T In 1913, the logician
Henry M. Sheffer created a connective that we now refer to as Sheffer's stroke (or
NAND). This connective is often denoted by the symbol . Table 3.13 shows that ...
Richard Aufmann, Joanne Lockwood, Richard Nation,
2014
2
Mathematical Excursions
In 1913, the logician Henry M. Sheffer created a connective that we now refer to
as Sheffer's stroke (or NAND). This connective is often denoted by the symbol .
Table 3.13 shows that p q is equivalent to p q. Sheffer's stroke p q is false when ...
Richard Aufmann, Joanne Lockwood, Richard Nation,
2012
3
Mathematical Excursion, Enhanced Edition
Excursion Sheffer's Stroke and the NAND Gate Exercise Set 3.4 Table 3.12 1100
Input streams 1010 Output. pq TT F TF T FT T FF T Table 3.11 Sheffer's stroke In
1913, the logician Henry M. Sheffer created a connective that we now refer to as
...
Richard Aufmann, Joanne Lockwood, Richard Nation,
2009
prove that Sheffer's stroke alone must be adequate too. As you might expect, the
proof proceeds by finding semantically equivalent truth-functions for '~' and 'v' in
terms of '|' alone. So, there are only two cases to worry about. Here are the ...
5
Mathematical thinking and quantitative reasoning
Table 2.10 Sheffer's stroke In 1913, the logician Henry M. Sheffer created a
connective that we now refer to as Sheffer's stroke (or NAND). This connective is
often denoted by the symbol . Table 2.10 shows that is equivalent to Sheffer's
stroke is ...
Just when everything looks most unfortunate, a surprise visitor appears: the |-
operator. The |-operator is pronounced nand operator (short for not and). It's
sometimes called Sheffer's stroke, after inventor, Henry Sheffer. The statement x |
y is ...
7
Natural Deduction: An Introduction To Logic With Real ...
Actually, greater economy of expression still can be achieved through the use of
either of two new operators, Peirce's Arrow Operator 'i,' and Sheffer's Stroke
Operator '|,' in terms of either of which all the other operators can be defined?
Richard T.W. Arthur,
2011
8
The Development of Modern Logic
Among the results to be mentioned are Sheffer's (re)discovery (1913) of the
possibility of defining all Boolean propositional connectives starting from the
notion of incompatibility (Sheffer's stroke). Using Sheffer's stroke, Nicod (1916–
1919) was ...
Department of Philosophy University of Tampere Leila Haaparanta Professor, Finland,
2009
9
The Realism-Antirealism Debate in the Age of Alternative Logics
Take the following simple example: suppose that instead of defining classical
logic with the usual conjunction, disjunction, implication and negation constants (
and bottom), we use Sheffer's stroke (and bottom). It is well known that classical ...
Shahid Rahman, Giuseppe Primiero, Mathieu Marion,
2011
10
The Oxford Handbook of Wittgenstein
... of Russell's paper entitled “On Matter—The Problem Stated,” there are jottings
in Russell's and Wittgenstein's hands which reveal that they were discussing truth
-tables and Sheffer's stroke (McGuinness 1988, 160). In the verso,12 the Sheffer
...
Oskari Kuusela, Marie McGinn,
2011