The rules depend on which logical connectives appear in the formula.

They correspond to the unchanged statements among the 2-ary logical connectives.

The following are the most common defined logical connectives:

They explain how certain logical connectives such as "if-then" work in terms of necessity and possibility.

The latter include logical connectives, quantifiers, and variables that stand for statements.

One strategy is to use complicated logical connectives in your questions (either biconditionals or some equivalent construction).

The T-schema interprets the logical connectives using truth tables, as discussed above.

These correspond to possible choices of binary logical connectives for classical logic.

Propositions can be joined together using logical connectives to make new propositions.

This is how we define logical connectives in propositional logic:

Various English words and word pairs express logical connectives, and some of them are synonymous.

There are no minimal functionally complete sets of more than three at most binary logical connectives.

It follows that an atomic sentence contains no logical connectives, variables or quantifiers.

Indeed, all of the logical connectives can be defined in terms of a sole sufficient operator.

The modern view is more complex, since a single judgement of Aristotle's system will involve two or more logical connectives.

As befits a logical language, there is a large assortment of logical connectives.

Two important types of logical constants are logical connectives and quantifiers.

The omega set is a finite set of elements called operator symbols or logical connectives.

Łukasiewicz invented the Polish notation (named after his nationality) for the logical connectives around 1920.

Formulas are built out of atomic formulas using logical connectives and quantifiers.

Some logical connectives possess properties which may be expressed in the theorems containing the connective.

The following are the minimal functionally complete sets of logical connectives with arity 2:

In other words, it is sufficient to have and , or and , as the only logical connectives.

In this way all logical connectives can be expressed in terms of preserving logical truth.

Not all logical systems are truth-valuational in the sense that logical connectives may be interpreted as truth functions.