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 10:51, 19 November 2007 editJzG (talk | contribs)Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers, Rollbackers155,086 editsm Protected Boolean-valued function: Vandalism (expires 10:51, May 19, 2008 (UTC))← Previous edit Revision as of 21:37, 19 November 2007 edit undoBrigit Zilwaukee (talk | contribs)34 editsm Article Withdrawn By Request Of Author (Cf. http://wikipediareview.com/index.php?s=&showtopic=13980&view=findpost&p=60795)Next edit →
Line 1: Line 1:
#REDIRECT ]
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 21:37, 19 November 2007

Redirect to: