Logical connective

From formulasearchengine
Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}} {{ safesubst:#invoke:Unsubst||$N=Technical |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }}

In logic, a logical connective (also called a logical operator) is a symbol or word used to connect two or more sentences (of either a formal or a natural language) in a grammatically valid way, such that the sense of the compound sentence produced depends only on the original sentences.

The most common logical connectives are binary connectives (also called dyadic connectives) which join two sentences which can be thought of as the function's operands. Also commonly, negation is considered to be a unary connective.

Logical connectives along with quantifiers are the two main types of logical constants used in formal systems such as propositional logic and predicate logic. Semantics of a logical connective is often, but not always, presented as a truth function.

In language

Natural language

In the grammar of natural languages two sentences may be joined by a grammatical conjunction to form a grammatically compound sentence. Some but not all such grammatical conjunctions are truth functions. For example, consider the following sentences:

A: Jack went up the hill.
B: Jill went up the hill.
C: Jack went up the hill and Jill went up the hill.
D: Jack went up the hill so Jill went up the hill.

The words and and so are grammatical conjunctions joining the sentences (A) and (B) to form the compound sentences (C) and (D). The and in (C) is a logical connective, since the truth of (C) is completely determined by (A) and (B): it would make no sense to affirm (A) and (B) but deny (C). However, so in (D) is not a logical connective, since it would be quite reasonable to affirm (A) and (B) but deny (D): perhaps, after all, Jill went up the hill to fetch a pail of water, not because Jack had gone up the hill at all.

Various English words and word pairs express logical connectives, and some of them are synonymous. Examples (with the name of the relationship in parentheses) are:

The word "not" (negation) and the phrases "it is false that" (negation) and "it is not the case that" (negation) also express a logical connective – even though they are applied to a single statement, and do not connect two statements.

Formal languages

In formal languages, truth functions are represented by unambiguous symbols. These symbols are called "logical connectives", "logical operators", "propositional operators", or, in classical logic, "truth-functional connectives". See well-formed formula for the rules which allow new well-formed formulas to be constructed by joining other well-formed formulas using truth-functional connectives.

Logical connectives can be used to link more than two statements, so one can speak about "[[arity|Template:Var-ary]] logical connective".

Common logical connectives

Name / Symbol Truth table Venn
diagram
Template:Mvar = 0 1
Truth/Tautology   1 1 Venn11.svg
Proposition Template:Mvar   0 1 Venn01.svg
False/Contradiction   0 0 Venn00.svg
Negation ¬   1 0 Venn10.svg
Binary connectives Template:Mvar = 0 0 1 1
  Template:Mvar = 0 1 0 1
Conjunction 0 0 0 1 Venn0001.svg
Alternative denial 1 1 1 0 Venn1110.svg
Disjunction 0 1 1 1 Venn0111.svg
Joint denial 1 0 0 0 Venn1000.svg
Material conditional 1 1 0 1 Venn1011.svg
Exclusive or 0 1 1 0 Venn0110.svg
Biconditional 1 0 0 1 Venn1001.svg
Converse implication 1 0 1 1 Venn1101.svg
Proposition Template:Mvar 0 0 1 1 Venn0101.svg
Proposition Template:Mvar 0 1 0 1 Venn0011.svg
More information

List of common logical connectives

Commonly used logical connectives include:

Alternative names for biconditional are "iff", "xnor" and "bi-implication".

For example, the meaning of the statements it is raining and I am indoors is transformed when the two are combined with logical connectives:

For statement P = It is raining and Q = I am indoors.

It is also common to consider the always true formula and the always false formula to be connective:

  • True formula (⊤, 1, Vpq, or T)
  • False formula (⊥, 0, Opq, or F)

History of notations

Some authors used letters for connectives at some time of the history: u. for conjunction (German's "und" for "and") and o. for disjunction (German's "oder" for "or") in earlier works by Hilbert (1904); Np for negation, Kpq for conjunction, Apq for disjunction, Cpq for implication, Epq for biconditional in Łukasiewicz (1929).[12]

Redundancy

Such logical connective as converse implication ← is actually the same as material conditional with swapped arguments, so the symbol for converse implication is redundant. In some logical calculi (notably, in classical logic) certain essentially different compound statements are logically equivalent. A less trivial example of a redundancy is the classical equivalence between ¬P ∨ Q and P → Q. Therefore, a classical-based logical system does not need the conditional operator "→" if "¬" (not) and "∨" (or) are already in use, or may use the "→" only as a syntactic sugar for a compound having one negation and one disjunction.

There are sixteen Boolean functions associating the input truth values Template:Mvar and Template:Mvar with four-digit binary outputs. These correspond to possible choices of binary logical connectives for classical logic. Different implementation of classical logic can choose different functionally complete subsets of connectives.

One approach is to choose a minimal set, and define other connectives by some logical form, like in the example with material conditional above. The following are the minimal functionally complete sets of operators in classical logic whose arities do not exceed 2:

One element
{↑}, {↓}.
Two elements
{, ¬}, {, ¬}, {→, ¬}, {←, ¬}, {→, }, {←, }, {→, }, {←, }, {→, }, {→, }, {←, }, {←, }, {, ¬}, {, ¬}, {}, {}, {}, {}.
Three elements
{, , }, {, , }, {, , }, {, , }, {, , }, {, , }.

See more details about functional completeness in classical logic at Functional completeness in truth function.

Another approach is to use on equal rights connectives of a certain convenient and functionally complete, but not minimal set. This approach requires more propositional axioms and each equivalence between logical forms must be either an axiom or provable as a theorem.

But intuitionistic logic has the situation more complicated. Of its five connectives {∧, ∨, →, ¬, ⊥} only negation ¬ has to be reduced to other connectives (see details). Neither of conjunction, disjunction and material conditional has an equivalent form constructed of other four logical connectives.

Properties

Some logical connectives possess properties which may be expressed in the theorems containing the connective. Some of those properties that a logical connective may have are:

For classical and intuitionistic logic, the "=" symbol means that corresponding implications "…→…" and "…←…" for logical compounds can be both proved as theorems, and the "≤" symbol means that "…→…" for logical compounds is a consequence of corresponding "…→…" connectives for propositional variables. Some many-valued logics may have incompatible definitions of equivalence and order (entailment).

Both conjunction and disjunction are associative, commutative and idempotent in classical logic, most varieties of many-valued logic and intuitionistic logic. The same is true about distributivity of conjunction over disjunction and disjunction over conjunction, as well as for the absorption law.

In classical logic and some varieties of many-valued logic, conjunction and disjunction are dual, and negation is self-dual, the latter is also self-dual in intuitionistic logic.

Template:Expand section

Order of precedence

As a way of reducing the number of necessary parentheses, one may introduce precedence rules: has higher precedence than , higher than , and higher than . So for example, is short for .

Here is a table that shows a commonly used precedence of logical operators.

Operator Precedence
1
2
3
4
5

The order of precedence determines which connective is the "main connective" when interpreting a non-atomic formula.

Computer science

Template:Expand section

A truth-functional approach to logical operators is implemented as logic gates in digital circuits. Practically all digital circuits (the major exception is DRAM) are built up from NAND, NOR, NOT, and transmission gates; see more details in Truth function in computer science. Logical operators over bit vectors (corresponding to finite Boolean algebras) are bitwise operations.

But not every usage of a logical connective in computer programming has a Boolean semantic. For example, lazy evaluation is sometimes implemented for P ∧ Q and P ∨ Q, so these connectives are not commutative if some of expressions Template:Mvar, Template:Mvar has side effects. Also, a conditional, which in some sense corresponds to the material conditional connective, is essentially non-Boolean because for if (P) then Q; the consequent Q is not executed if the antecedent P is false (although a compound as a whole is successful ≈ "true" in such case). This is closer to intuitionist and constructivist views on the material conditional, rather than to classical logic's ones.

See also

Template:Col-begin Template:Col-break

Template:Col-break {{#invoke:Portal|portal}}

Template:Col-end

Notes

  1. 1.0 1.1 Heyting (1929) Die formalen Regeln der intuitionistischen Logik.
  2. Denis Roegel (2002), Petit panorama des notations logiques du 20e siècle (see chart on page 2).
  3. 3.0 3.1 3.2 3.3 Russell (1908) Mathematical logic as based on the theory of types (American Journal of Mathematics 30, p222–262, also in From Frege to Gödel edited by van Heijenoort).
  4. Peano (1889) Arithmetices principia, nova methodo exposita.
  5. 5.0 5.1 Schönfinkel (1924) Über die Bausteine der mathematischen Logik, translated as On the building blocks of mathematical logic in From Frege to Gödel edited by van Heijenoort.
  6. Peirce (1867) On an improvement in Boole's calculus of logic.
  7. Hilbert (1917/1918) Prinzipien der Mathematik (Bernays' course notes).
  8. Vax (1982) Lexique logique, Presses Universitaires de France.
  9. Tarski (1940) Introduction to logic and to the methodology of deductive sciences.
  10. Gentzen (1934) Untersuchungen über das logische Schließen.
  11. Chazal (1996) : Éléments de logique formelle.
  12. See Roegel

References

  • Bocheński, Józef Maria (1959), A Précis of Mathematical Logic, translated from the French and German editions by Otto Bird, D. Reidel, Dordrecht, South Holland.
  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

Further reading

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

External links

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

{{#invoke: Navbox | navbox }} Template:Mathematical logic

da:Logisk konnektiv he:קשר לוגי