
	Where results make sense

Topic: Sheffer stroke

Related Topics

Logical nand

Logical operator

Nor

Logical conjunction

Logic families

Logic gate

Boolean algebra

NMOS

Flash memory

Formula One

Venn diagram

Keke Rosberg

Luo Guan Zhong

The New Republic

Moller Skycar

In the News (Tue 8 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	PlanetMath: logical connective (Site not responding. Last check: 2007-10-20)
		In the late 19th century and early 20th century, C. Peirce and H. Sheffer independently discovered that a single binary connective suffices to define all logical connectives.
		The Sheffer stroke is defined by the truth table
		For this reason, the Sheffer stroke is sometimes called alternative denial or NAND.
	planetmath.org /encyclopedia/LogicalConnective.html (231 words)

	[No title] (Site not responding. Last check: 2007-10-20)
		propositional logics and the elsewhere of the sheffer stroke and its dual.
		in relation to the dual v, the stroke retaining the dissemination of division, the dual tending towards the problematic of the scapegoat and expulsion doubt and deconstruction of conclusions.
		but the sixth go at it is not the sixth go at it all, not of the sub- stance of which it is a part, not fissured or broken down, not corrupted, propositional logics and the elsewhere of the sheffer stroke and its dual.
	kunst.no /alias/HJEMMESIDE/bjornmag/nettext/sophia.txt (1910 words)

	Sheffer stroke - ikiW
		The Sheffer stroke, written "" or "↑", denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both".
		The stroke is named for Henry M. Sheffer, who proved (Sheffer 1913) that all the usual operators of propositional logic (not, and, or, implies, and so on), could be expressed in terms of it.
		Peirce also observed that all boolean operators could be defined in terms of the NOR operator, the dual of NAND.
	sheffer-stroke.ikiw.net /en/Sheffer_stroke (220 words)

	Sheffer stroke - Wikipedia, the free encyclopedia
		Peirce also observed that all boolean operators could be defined in terms of the NOR operator, the dual of NAND.
		The Sheffer stroke "" is equivalent to the negation of conjunction:
		Hence any formal system including the Sheffer stroke must also include a means of indicating grouping.
	en.wikipedia.org /wiki/Sheffer_stroke (935 words)

	Philosophie/Wittgenstein and digital facticity
		The work relies on the Sheffer stroke* ("not both A and B") and its dual ("neither A nor B") to construct a logical picture of the world.
		This is, he [Wittgenstein] says, the general truth-function and also the general form of proposition." (Russell introduction.) Certainly, the Sheffer stroke and its dual operate on a Boolean calculus with 0 and 1 values, a digital domain.
		If the stroke itself is a phallic reordering of the propositional calculus into a singular basis, the negation is an opening beyond or elsewhere than the calculus.
	agora.qc.ca /textes/witt.html (1483 words)

	Sierpinski Tautology Map
		It is clear that a Sheffer stroke between and 0000 or any other value amounts to a tautology.
		A Sheffer stroke between two tautologies, on the other hand, amounts to a contradiction, indicated by the dark grey square at the intersection of two fl axis values in the lower right corner.
		The initially startling appearance of the Sierpinski gasket as a map of tautologies under the Sheffer stroke can thus be understood in terms of (i) what a binary representation of values means and (ii) a corresponding rendering of the familiar 'doubling the distance from the nearest vertex' route to the Sierpinski in terms of binaries.
	www.sunysb.edu /philosophy/fractal/Sierpins.html (2671 words)

	Sheffer stroke - Wikipedia Mirror (Site not responding. Last check: 2007-10-20)
		The Sheffer stroke, written "" or "↑", denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both".
		It is one of several sole sufficient operators that can be used to express all of the boolean functions that are the subject matter of propositional logic.
		It is named for Henry M. Sheffer, who proved (Sheffer 1913) that all the usual operators of propositional logic (not, and, or, implies, and so on), could be expressed in terms of it.
	www.wiki-mirror.us /index.php/Logical_nand (901 words)

	Expression (Site not responding. Last check: 2007-10-20)
		It is known that Sheffer stroke function (NOT-AND) can be used to construct any Boolean function.
		Your task is to construct a logical expression using the Sheffer stroke function that computes the value of the overflow bit for arbitrary values of A and B.
		is an expression that denotes the result of Sheffer stroke function for x and y, where x and y are expressions.
	acm.uva.es /p/v101/10144.html (307 words)

	Sheffer Corporation: Custom Products (Site not responding. Last check: 2007-10-20)
		From the very beginning, special orders and custom solutions have been a strong point at Sheffer, stemming from our spirit of innovation.
		This, coupled with a dedication to quality and long service life, has enabled Sheffer cylinders to excel in some of the harshest environments and roughest conditions - and for some of the most prestigious customers - in the world.
		Sheffer has manufactured cylinders within the specifications listed below, but they do not represent the limits of our capabilities.
	www.sheffercorp.com /products/custom_products.shtm (126 words)

	Simple Axiom Systems for Boolean Algebra
		This basis is especially simple in that it has a total of only 6 applications of the Sheffer stroke operator.
		This equation is the ``mirror image'' of Equation 10 from the candidate set, where the mirror image is found by applying commutativity to each occurrence of the Sheffer stroke operator.
		A number of single axioms in terms of operators other than the Sheffer stroke are presented in [6].
	www.cs.unm.edu /~veroff/BA (826 words)

	Reference.com/Encyclopedia/Sheffer stroke
		The Sheffer stroke "" is equivalent to the negation of conjunction:
		The following is an example of a formal system based entirely on the Sheffer stroke, yet having the functional expressiveness of the propositional logic:
		Hence any formal system including the Sheffer stroke must also include a means of indicating grouping.
	www.reference.com /browse/wiki/Sheffer_stroke (983 words)

	3. 'Rug' Enumeration images
		Here formula 1 is p p, formed by a single stroke between the formula heading its row and the formula at the top of its column.
		It is clear that dagger tautologies mirror Sheffer stroke contradictions, with dagger contradictions corresponding to Sheffer tautologies.
		Since existential quantification can be expressed in terms of universal quantification and negation, and the latter can be expressed by the Sheffer stroke in familiar ways, such a schema will include all wffs of predicate calculus involving only monadic predicate letters, together with all corresponding propositional formulae.
	www.sunysb.edu /philosophy/fractal/Rug.html (1833 words)

	Logical NAND - Textop Wiki
		Logical NAND, for Not And, sometimes denoted by a symbol "" or "↑" called the Sheffer stroke, is a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both".
		The name Sheffer stroke refers to Henry M. Sheffer, who proved that all of the usual operators of propositional logic (not, and, or, implies, and so on), could be expressed in terms of it (Sheffer 1913).
		Peirce also observed that all boolean operators could be defined in terms of the NNOR operator, the dual of NAND.
	www.textop.org /wiki/index.php?title=Logical_NAND (1106 words)

	A Short Sheffer Axiom for Boolean Algebra (ResearchIndex) (Site not responding. Last check: 2007-10-20)
		Abstract: A short Sheffer stroke identity is shown to be a single axiom for Boolean algebra.
		The proof shows that it is equivalent to Sheffer's original 3-basis for the theory.
		5 Equational postulates for the Sheffer stroke (context) - Meredith - 1969
	citeseer.ist.psu.edu /327640.html (340 words)

	Practical Foundations of Mathematics (Site not responding. Last check: 2007-10-20)
		The Sheffer stroke Whereas in art and in other parts of mathematics symmetry is considered beautiful, many logic texts use the de Morgan duality to eradicate half of the calculus in a quite arbitrary way.
		) is commonly known as the Sheffer stroke.
		Although this nihilist tendency contributed to the failure of mainstream logic to observe the propositions as types analogy (which is very clear in intuitionism), or to recognise the quantifiers as adjoints, the Sheffer stroke is the building block of digital electronics, where it is called nand.
	www.cs.man.ac.uk /~pt/Practical_Foundations/html/s18.html (2566 words)

	Formal Structure of Dialectical Psychology (Site not responding. Last check: 2007-10-20)
		Also apparent is the "law of the excluded middle." The symmetric difference and its complement are equivalent in logic to the Sheffer stroke, which can of itself generate the operations of Boolean algebra (Sheffer, 1913), and so, ordinary first order logic.
		The last of these is the Sheffer stroke, from which all other logical operations are derivable.
		Sheffer, H. A set of five independent postulates for Boolean algebras, with application to logical constants.
	goertzel.org /dynapsyc/1996/formstr.html (3870 words)

	Experimenting with Signals
		After the First World War, one of Russell's most brilliant students and one of the most important philosophers of the last century, Ludwig Wittgenstein, published Tractatus Logico-Philosophicus and demonstrated the use of the truth table to express the relationships of symbolic logic.
		Even earlier, though, Henry Maurice Sheffer had shown that all the symbols used by Russell and Whitehead for propositional logic could be replaced with a single symbol (the Sheffer stroke).
		For bonus points there will be questions on the midterm that call on you to use truth-tables to decide the equivalence of expressions using just the Sheffer stroke with expressions using our other operators.
	www.internetlogic.org /Stroke.html (469 words)

	SparkNotes: Tractatus Logico-philosophicus: 5.47–5.54
		When Wittgenstein claims that all propositions can be derived by successive applications of a negating operation, he is alluding to the "Sheffer stroke," a logical constant discovered in the early 20th century.
		While Frege develops a system that relies only on the logical constants "not" and "ifthen," and Russell develops a system that relies only on the logical constants "not" and "or," it was discovered that the Sheffer stroke—usually symbolized as a vertical bar, ""—was a logical constant that could stand on its own.
		Wittgenstein draws on the Sheffer stroke to show that a single operation can be used to derive any proposition from any other proposition.
	www.sparknotes.com /philosophy/tractatus/section9.rhtml (1274 words)

	Sheffer stroke
		The Sheffer stroke, also known as the NAND operation, is a logical operator with the following meaning: p NAND q is true if and only if not both p and q are true.
		It is named for Henry M. Sheffer, who proved that all the usual operators of logical calculus (not, and, or, implies) could be expressed in terms of it:
		A set of five independent postulates for Boolean algebras, with application to logical constants.
	www.ebroadcast.com.au /lookup/encyclopedia/sh/Sheffer_stroke.html (149 words)

	Short Single Axioms for Boolean Algebra
		Wolfram's 25 candidates are precisely the set of Sheffer identities of length <= 15 (excluding mirror images) that have no noncommutative models of size <=4.
		This is the set of Sheffer stroke identities of length <= 15, excluding mirror images, and is straightforward to generate.
		The simple Perl program commute4_filter takes a stream of Sheffer identities and filters out those with noncommutative models of size up through 4.
	www.cs.unm.edu /~mccune/papers/basax (276 words)

	Springer Online Reference Works
		Peirce's arrow has the property that all logical operations can be expressed in terms of it.
		A more familiar two-place logical operation in terms of which all others can be expressed is the so-called Sheffer stroke "A
		The Peirce arrow and the Sheffer stroke are each other negations.
	eom.springer.de /p/p071960.htm (84 words)

	Propositional Logic [Internet Encyclopedia of Philosophy]
		In 1917, French logician Jean Nicod discovered that an axiomatization for propositional logic using the Sheffer stroke involving only a single axiom schema and single inference rule was possible.
		Sheffer, who first publicized the result that all truth-functional connectives could be defined in virtue of a single operator in 1913.
		The sign '↓' is sometimes also referred to as the Sheffer stroke, and is also called the Peirce/Sheffer dagger.
	www.utm.edu /research/iep/p/prop-log.htm (8796 words)

	ALTERNATE CONNECTIVES
		Still another suggestion to reduce the number of connectives required came from H.M. Sheffer, who showed that "alternative denial" (the NAND relationship) could be used to express every possibility.
		In our conventional notation we still need the tilde (or curl) but could otherwise make use of just one more connective.
		Suppose we used both the stroke and the dagger.
	www.internetlogic.org /alternates.html (266 words)

	No Title (Site not responding. Last check: 2007-10-20)
		We are attempting to show that there are not too many proofs under the Sheffer's stroke tableau system.
		This process clearly gives a simulation of the stroke tableau using a standard tableau, since the tableaux are equivalent at every level (by the lemma).
		By the same reasoning as in the consistency case, this means there cannot be fewer stroke proofs than standard proofs.
	www.cs.cornell.edu /Info/Courses/Spring-97/CS486/hw/solution2/solution2.html (296 words)

	Axiom Systems for Boolean Algebra Using the Sheffer Stroke - Veroff (ResearchIndex) (Site not responding. Last check: 2007-10-20)
		In each case, we indicate how the given system can be used to derive the system presented by Sheer in 1913 (Sheer[5]).
		Veroff, R., "Axiom Systems for Boolean Algebra Using the Sheffer Stroke," submitted to Notre Dame J. of Formal Logic.
		2 Equational postulates for the Sheer stroke (context) - Meredith - 1969
	citeseer.ist.psu.edu /veroff00axiom.html (405 words)

	The Universe of Discourse : 1+1=2
		In 2006, we dispense with "functions of two variables", and just talk about functions whose (single) argument is an ordered pair; a relation then becomes the set of all ordered pairs for which a function is true.
		Russell is supposed to have said that the discovery of the Sheffer stroke (a single logical operator from which all the other logical operators can be built) was a tremendous advance, and would change everything.
		This seems strange to us now, because the discovery of the Sheffer stroke seems so simple, and it really doesn't change anything important.
	blog.plover.com /2006/06/18 (2265 words)

	An ordered pair with Sheffer's stroke?
		First of all, I beg to be forgiven this intrusion.
		object which is an argument to the middle stroke in the definiendum.
		The definition of the AND (and) connective in terms of the stroke is:
	www.groupsrv.com /science/ptopic78381.html (1592 words)

	Springer Online Reference Works
		All other logical operations can be expressed by the Sheffer stroke.
		H.M. Sheffer, "A set of five independent postulates for Boolean algebras, with applications to logical constants" Trans.
		The Sheffer stroke operation is also called alternative denial.
	eom.springer.de /s/s084860.htm (92 words)

	AARNEWS - August 2000
		In his article, Fitelson mentions the so-called Sheffer stroke, for which a number of simplifications have been published.
		Also in this issue of the AAR Newsletter, Robert Veroff reports on his current research on the Sheffer stroke, work that he is doing in collaboration with several colleagues including Fitelson.
		My colleagues and I are using Otter to find short bases for Boolean algebra in terms of the Sheffer stroke.
	www.mcs.anl.gov /AAR/issueaugust00/issueaugust00.html (3321 words)

Try your search on: Qwika (all wikis)