请输入您要查询的字词:

 

单词 LogicalConnective
释义

logical connective


In propositional logicPlanetmathPlanetmath, the usual way of forming a well-formed formula out of existing ones is by attaching a designated symbol to the existing wffs. This designated symbol is variously known as a logical connective, logical symbol, or simply a connective. Given a connective, the number of wffs needed to form a new wff is a fixed integer, and is called the arity of the connective. For example, if # is a connective of arity 3, and p,q,r are three existing wffs, then

#pqr

is the wff formed by attaching # to the p,q and r in order. Instead of prefixing to the string of wffs as above, the connective may also be attached at the end (as a suffix), or customarily infixed in case it has arity of 2 (binary). 0-ary connectives are also allowed, in which case it is just a symbol with no wffs attached.

The common classical logical connectives are:

  • ¬: logical not (http://planetmath.org/Negation);

  • : logical or;

  • : logical and;

  • or : material implication; and

  • or : material equivalence (http://planetmath.org/BiconditionalMathworldPlanetmathPlanetmath).

The symbols and are due to Russell.

Remark. “Logical implication and “logical is equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath to symbols are typically used for logicians. Nevertheless, the symbols for material implication and for material equivalence are commonly used in the literature. In particular, is usually reserved for the concept of limit.

Usually, given a logical connective #, a truth function is associated. The arity of the truth function is defined to be the arity of the connective. When there is no confusion, the symbol for the associated truth function is the same as the symbol of the connective. A truth function of small arity can be easily represented by a table, called the truth tableMathworldPlanetmath of the truth function. The truth functions and truth tables associated with the connectives listed above are

  • ¬:𝟐𝟐 given by ¬(x)=1-x;

  • :𝟐2𝟐 given by (x,y)=max(x,y);

  • :𝟐2𝟐 given by (x,y)=min(x,y);

  • :𝟐2𝟐 given by (x,y)=max(1-x,y); and

  • :𝟐2𝟐 given by (x,y)=(x+y+1)(mod2).

where 𝟐={0,1}. Note that 0 and 1 have been converted to F and T in the tables above.

Any truth function of any finite arity can be written as a finite combinationMathworldPlanetmathPlanetmath of these connectives (see the entry on functional completeness). However, the collectionMathworldPlanetmath is redundant; the final three symbols, , , and , can be defined in terms of prior ones. By DeMorgan’s law, we can define logical and by

PQ:=¬P¬Q.

Material implication can be defined by

PQ:=¬PQ.

Finally, material equivalence can be defined by

PQ:=(PQ)(QP)
=¬(¬PQ)¬(¬QP).

Hence ¬ and suffice to define all other connectives.

Titlelogical connective
Canonical nameLogicalConnective
Date of creation2013-03-22 16:26:58
Last modified on2013-03-22 16:26:58
Ownermps (409)
Last modified bymps (409)
Numerical id19
Authormps (409)
Entry typeDefinition
Classificationmsc 03B05
Synonymlogical symbol
Synonymconnective
Synonymconjunctive connective
Synonymdisjunctive connective
Related topicAmpheck
Related topicContradictoryStatement
Related topicLogicalAxiom
Related topicSoleSufficientOperator
Related topicPropositionalCalculus
Related topicLogicalImplication
Related topicZerothOrderLogic
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 3:54:06