Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Truth value
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Classical logic == {| class="floatright" cellpadding=0 style="text-align:center;" |- | | style="font-size:300%; font-weight:700;" | β€ | rowspan=5 | | style="font-size:300%;" | Β·'''β§'''Β· |- | | true | <small>[[logical conjunction|conjunction]]</small> |- | style="font-size:250%; font-weight:300;" | Β¬ | style="font-size:200%; font-weight:500;" | β | style="font-size:200%; font-weight:500;" | β |- | | style="font-size:300%; font-weight:700;" | β₯ | style="font-size:300%;" | Β·'''β¨'''Β· |- | | false | <small>[[logical disjunction|disjunction]]</small> |- | colspan=4 style="padding-left:24px; padding-top:8px; padding-bottom:14px; text-align:left;" | <small>Negation interchanges <br/>true with false and <br/>conjunction with disjunction.</small> |} In [[classical logic]], with its intended semantics, the truth values are ''[[logical truth|true]]'' (denoted by ''1'' or the [[verum]] β€), and ''[[false (logic)|untrue]]'' or ''[[false (logic)|false]]'' (denoted by ''0'' or the [[falsum]] β₯); that is, classical logic is a [[two-valued logic]]. This set of two values is also called the [[Boolean domain]]. Corresponding semantics of [[logical connective]]s are [[truth function]]s, whose values are expressed in the form of [[truth table]]s. [[Logical biconditional]] becomes the [[equality (mathematics)|equality]] binary relation, and [[negation]] becomes a [[bijection]] which [[permutation|permutes]] true and false. Conjunction and disjunction are [[Dual (mathematics)#Duality in logic and set theory|dual]] with respect to negation, which is expressed by [[De Morgan's laws]]: : Β¬({{math|{{mvar|p}} β§ {{mvar|q}}) β Β¬{{mvar|p}}ββ¨βΒ¬{{mvar|q}}}} : Β¬({{math|{{mvar|p}} β¨ {{mvar|q}}) β Β¬{{mvar|p}}ββ§βΒ¬{{mvar|q}}}} [[Propositional variable]]s become [[Variable (computer science)|variables]] in the Boolean domain. Assigning values for propositional variables is referred to as [[valuation (logic)|valuation]]. <!-- Also something should be written about first-order logics -->
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)