(0,1)-category theory: logic, order theory
proset, partially ordered set (directed set, total order, linear order)
distributive lattice, completely distributive lattice, canonical extension
In logic, logical conjunction is the meet in the poset of truth values.
Assuming that (as in classical logic) the only truth values are true () and false (), then the conjunction of the truth values and may be defined by a truth table:
That is, is true if and only if and are both true. Conjunction also exists in nearly every non-classical logic.
More generally, if and are any two relations on the same domain, then we define their conjunction pointwise, thinking of a relation as a function to truth values. If instead we think of a relation as a subset of its domain, then conjunction becomes intersection.
Conjunction is de Morgan dual to disjunction.
Like any meet, conjunction is an associative operation, so we can take the conjunction of any finite positive whole number of truth values; the conjunction is true if and only if all of the individual truth values are true. Conjunction also has an identity element, which is the true truth value. Some logics allow a notion of infinitary conjunction. Indexed conjunction is universal quantification.
As truth values form a poset, which is a degenerate kind of category, so truth values under conjunction form a meet-semilattice, which is a degenerate kind of cartesian monoidal category. Self-referentially, a poset is (up to equivalence) simply a category enriched over the cartesian monoidal category of truth values. With implication as internal hom, truth values form a closed cartesian category.
In the context of substructural logics such as linear logic, the conjunction defined above is also called additive conjunction to disambiguate it from the multiplicative conjunction.
That conjunction is a meet means that may be proved in a context if and only if both and may be proved in . This directly yields the introduction and elimination rules for conjunction in natural deduction:
Alternatively, we may use these slightly more complicated (but fewer) inductive forms:
In sequent calculus, the same ideas become these rules:
Equivalently, we can use the following rules with weakened contexts:
The rules above are written so as to remain valid in logics without the exchange rule. In linear logic, the first batch of sequent rules apply to additive conjunction (interpret in these rules as ), while the second batch of rules apply to multiplicative conjunction (interpret in those rules as ).
Logical conjunction as
a logic gate,
a reversible logic gate and
a (reversible) quantum logic gate:
临官是什么意思 | 血小板是什么颜色的 | 胰腺炎挂什么科 | 狗狗打喷嚏流鼻涕怎么办吃什么药 | 口苦口干口臭吃什么药 |
什么是脑梗死 | 兄长是什么意思 | 万马奔腾是什么意思 | 互粉是什么意思 | 什么地眨眼 |
为什么会胃疼 | 心脏早博吃什么药好 | 匪夷所思是什么意思 | 23号来月经什么时候是排卵期 | 跖疣挂什么科 |
高傲什么意思 | 单宁是什么意思 | 银屑病为什么会自愈 | 宇舶手表什么档次 | 冬枣什么时候成熟 |
cct是什么意思hcv7jop5ns4r.cn | 狗皮肤溃烂用什么药hcv9jop5ns1r.cn | 327是什么星座hcv8jop0ns3r.cn | 精神病吃什么药hcv8jop9ns4r.cn | 高反人群一般是什么人aiwuzhiyu.com |
他汀是什么药hcv7jop9ns2r.cn | 眩晕吃什么药好hcv8jop1ns2r.cn | 尿血挂什么科hcv9jop1ns3r.cn | 人属于什么界门纲目科属种hcv7jop6ns9r.cn | 宫腔积液吃什么药效果最好hcv9jop6ns6r.cn |
剪发虫是什么hcv9jop5ns1r.cn | 一什么毛驴hcv8jop3ns6r.cn | 肌醇是什么520myf.com | 参天大树什么意思hcv8jop2ns1r.cn | 蛇吃什么东西hcv9jop2ns0r.cn |
压力等于什么hcv9jop3ns6r.cn | 蟾蜍是什么动物hcv9jop8ns1r.cn | 黄芪起什么作用hcv8jop5ns5r.cn | 梦到小男孩是什么意思hcv8jop3ns9r.cn | 覆盖是什么意思hcv8jop7ns8r.cn |
Last revised on March 29, 2023 at 10:24:04. See the history of this page for a list of all contributions to it.