Misplaced Pages

Boolean-valued function

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by Jon Awbrey (talk | contribs) at 21:08, 28 June 2006 (References: add refs & ). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 21:08, 28 June 2006 by Jon Awbrey (talk | contribs) (References: add refs & )(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Boolean-valued function" – news · newspapers · books · scholar · JSTOR (Learn how and when to remove this message)

A boolean-valued function, in some usages a predicate or a proposition, is a function of the type f : X B {\displaystyle f:X\to \mathbb {B} } , where X {\displaystyle X} is an arbitrary set, where B {\displaystyle \mathbb {B} } is a generic 2-element set, typically B = { 0 , 1 } {\displaystyle \mathbb {B} =\left\{0,1\right\}} , and where the latter is frequently interpreted for logical applications as B = { f a l s e , t r u e } {\displaystyle \mathbb {B} =\left\{false,true\right\}} .

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

  • Kohavi, Zvi (1978), Switching and Finite Automata Theory, 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978.
  • Mathematical Society of Japan, Encyclopedic Dictionary of Mathematics, 2nd edition, 2 vols., Kiyosi Itô (ed.), MIT Press, Cambridge, MA, 1993. Cited as EDM (volume).

See also

Equivalent concepts

Related concepts

Categories: