Sole sufficient operator: Facts, Discussion Forum, and Encyclopedia Article

All Topics

Sole sufficient operator

	Email		Print
	Bookmark		Link

	Sole sufficient operator
	Home Discussion
	Topics Sole sufficient operator Topic Home A sole sufficient operator or a sole sufficient connective is an operator that is sufficient by itself to generate all of the operators in a specified class of operators. In logicLogic Logic, from Classical Greek ?????, originally meaning the word, or what is spoken, is most often said to be the stud... , it is a logical operator that suffices to generate all of the boolean-valued functionBoolean-valued function A boolean-valued function, in some usages a predicate or a proposition, is a function of the type f : X → '... s, , where is an arbitrary set and where is a generic 2-element set, typically , in particular, to generate all of the finitary boolean functionFinitary boolean function A finitary boolean function is a function of the type , where is a generic 2-element set, typically , frequently interprete... s, . See also Functional completenessFunctional completeness In logic, a set of logical connectives is functionally complete if all other possible connectives can be defined in terms of... AmpheckAmpheck Ampheck, from Greek 'double-edged', is a term coined by Charles Sanders Peirce for either one of the pair of logically dual... Logical graphLogical graph A logical graph is a special type of graph-theoretic structure in any one of several systems of graphical syntax that Charle... s Peirce arrow = NORLogical NOR The logical NOR or joint denial is a boolean logic operator which produces a result that is the inverse of logical or.... Sheffer strokeSheffer stroke The Sheffer stroke, written "\|" or "↑", denotes a logical operation that is equivalent to the negation of the conjuncti... = NAND