| Revision as of 04:54, 3 January 2008 edit12.75.22.78 (talk) «Article Withdrawn By Request Of Author (See http://wikipediareview.com/index.php?s=&showtopic=13980&view=findpost&p=60795)»← Previous edit | Revision as of 04:55, 3 January 2008 edit undoSlakr (talk | contribs)Edit filter managers, Administrators33,695 editsm Reverted edits by 12.75.22.78 (talk) to last version by SpebiNext edit → | ||
| Line 1: | Line 1: | ||
| A '''boolean-valued function''', in some usages a ] or a ], is a ] of the type f : X → '''B''', where X is an arbitrary ] and where '''B''' is a ]. | |||
| ⚫ | |||
| A '''boolean domain''' '''B''' is a generic 2-element set, say, '''B''' = {0, 1}, whose elements are interpreted as ]s, for example, 0 = false and 1 = true. | |||
| In the ]s, ], ], ], and their applied disciplines, a boolean-valued function may also be referred to as a ], ], ], or ]. In all of these uses it is understood that the various terms refer to a mathematical object and not the corresponding ] sign or syntactic expression. | |||
| In ] theories of ], a '''truth predicate''' is a predicate on the ]s of a ], 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== | |||
| * ] (2003), ''Boolean Reasoning: The Logic of Boolean Equations'', 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003. | |||
| * ] (1978), ''Switching and Finite Automata Theory'', 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978. | |||
| * ] (1974), ''Discrete Computational Structures'', Academic Press, New York, NY. | |||
| * ], ''Encyclopedic Dictionary of Mathematics'', 2nd edition, 2 vols., Kiyosi Itô (ed.), MIT Press, Cambridge, MA, 1993. Cited as EDM. | |||
| * ], and ] (1988), ''], An Introduction to Computational Geometry'', MIT Press, Cambridge, MA, 1969. Revised, 1972. Expanded edition, 1988. | |||
| ==See also== | |||
| {{col-begin}} | |||
| {{col-break}} | |||
| * ] | |||
| * ] | |||
| ⚫ | * ] | ||
| {{col-break}} | |||
| * ] | |||
| * ] | |||
| * ] | |||
| {{col-break}} | |||
| * ] | |||
| {{col-end}} | |||
| ===Equivalent concepts=== | |||
| * ] | |||
| * ] | |||
| * ], in some senses. | |||
| * ], in some senses. | |||
| ===Related concepts=== | |||
| * ] | |||
| * ] | |||
| ] | |||
| ] | |||
| ] | |||
| ] | |||
Revision as of 04:55, 3 January 2008
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.
See also
|
|
Equivalent concepts
- Characteristic function
- Indicator function
- Predicate, in some senses.
- Proposition, in some senses.