Definition:Logical Connective/Binary

From ProofWiki
Jump to navigation Jump to search


A binary logical connective (or two-place connective) is a logical connective whose effect on its compound statement is determined by the truth value of two substatements.

In standard Aristotelian logic, there are 16 binary logical connectives, cf. Binary Truth Functions.

In the field of symbolic logic, the following four (symbols for) binary logical connectives are commonly used:

Also defined as

Some sources use the term logical connective to mean binary logical connective exclusively, on the grounds that a unary logical connective does not actually "connect" anything.

However, this is a trivial distinction which can serve only to confuse.

Also known as

A binary logical connective is also known as:

a two-place connective.
a dyadic connective.

Some sources just call it a binary connective.

Also see

  • Results about logical connectives can be found here.