영어에서 SHEFFER'S STROKE 의 뜻은 무엇인가요?
셰퍼 스트로크
불리언 함수와 명제법에서 Henry M. Sheffer, "", "Dpq"또는 "↑"로 명명 된 Sheffer stroke는 결합 연산의 부정과 동등한 논리 연산을 일반 언어로 표현합니다 "둘 다 아닌"것으로. 사실상 적어도 하나의 피연산자가 거짓이라고 말하기 때문에 nand 또는 대체 거부라고도합니다. 부울 대수 및 디지털 전자 공학에서는이를 NAND 연산이라고합니다. NOR와 같은 듀얼, NAND는 다른 논리 연산자없이 논리 형식 시스템을 구성하기 위해 자체적으로 사용될 수 있습니다. 이 특성은 NAND 플래시 메모리 및 컴퓨터 프로세서 설계에서의 사용을 포함하여 NAND 게이트를 현대 디지털 전자 장치에 매우 중요하게 만든다.
영어 사전에서 Sheffer's stroke 의 정의
사전에서 Sheffer의 뇌졸중의 정의는 두 개의 문장의 함수로, 그것들의 결합의 부정에 해당하며, 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