Boolean-valued function


Boolean-valued function

A boolean-valued function, in some usages a predicate or a proposition, is a function of the type f : X → B, where X is an arbitrary set and where B is a boolean domain.

A boolean domain B is a generic 2-element set, say, B = {0, 1}, whose elements are interpreted as logical values, for example, 0 = false and 1 = true.

In the formal sciences, mathematics, mathematical logic, statistics, and their applied disciplines, a boolean-valued function may also be referred to as a characteristic function, indicator function, predicate, or proposition. In all of these uses it is understood that the various terms refer to a mathematical object and not the corresponding semiotic sign or syntactic expression.

In formal semantic theories of truth, a truth predicate is a predicate on the sentences of a formal language, interpreted for logic, that formalizes the intuitive concept that is normally expressed by saying that a sentence is true. A truth predicate may have additional domains beyond the formal language domain, if that is what is required to determine a final truth value.

References

* Brown, Frank Markham (2003), "Boolean Reasoning: The Logic of Boolean Equations", 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003.

* Kohavi, Zvi (1978), "Switching and Finite Automata Theory", 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978.

* Korfhage, Robert R. (1974), "Discrete Computational Structures", Academic Press, New York, NY.

* Mathematical Society of Japan, "Encyclopedic Dictionary of Mathematics", 2nd edition, 2 vols., Kiyosi Itô (ed.), MIT Press, Cambridge, MA, 1993. Cited as EDM.

* Minsky, Marvin L., and Papert, Seymour, A. (1988), "Perceptrons, An Introduction to Computational Geometry", MIT Press, Cambridge, MA, 1969. Revised, 1972. Expanded edition, 1988.

ee also


* Boolean algebra (logic)
* Boolean domain
* Boolean logic
* Propositional calculus
* Truth table
* Logic minimization

Equivalent concepts

* Characteristic function
* Indicator function
* Predicate, in some senses.
* Proposition, in some senses.

Related concepts

* Finitary boolean function
* Boolean function


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Boolean-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… …   Wikipedia

  • Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… …   Wikipedia

  • Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… …   Wikipedia

  • Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… …   Wikipedia

  • Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract …   Wikipedia

  • Boolean function — In mathematics, a (finitary) Boolean function is a function of the form f : B k rarr; B, where B = {0, 1} is a Boolean domain and k is a nonnegative integer called the arity of the function. In the case where k = 0, the function is essentially a… …   Wikipedia

  • Boolean domain — In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true . In mathematics and theoretical computer science, a Boolean domain is usually written as {0,1} or {ot …   Wikipedia

  • Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… …   Wikipedia

  • Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… …   Wikipedia

  • Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a …   Wikipedia


We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.