Misplaced Pages

Boolean-valued function: Difference between revisions

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.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 05:48, 31 July 2006 editJon Awbrey (talk | contribs)13,224 edits See also: add items← Previous edit Revision as of 05:52, 31 July 2006 edit undoJon Awbrey (talk | contribs)13,224 edits See also: add items, make 2 colsNext edit →
Line 18: Line 18:


==See also== ==See also==
{{col-begin}}

{{col-break}}
* ] * ]
* ] * ]
* ]
{{col-break}}
* ] * ]
* ]
* ]
{{col-end}}


===Equivalent concepts=== ===Equivalent concepts===

Revision as of 05:52, 31 July 2006

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.
  • 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: