This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate? Excessive Violence Sexual Content Political / Social
Email Address:
Article Id: WHEBN0001949883 Reproduction Date:
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 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:
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.
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 "n-ary logical connective".
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:
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]}
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. Less trivial example of a redundancy is a 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:
See more details about functional completeness in classical logic at Truth function#Functional completeness.
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.
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 of 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.
As a way of reducing the number of necessary parentheses, one may introduce precedence rules: ¬ has higher precedence than $\backslash wedge$, $\backslash wedge$ higher than $\backslash vee$, and $\backslash vee$ higher than →. So for example, P $\backslash vee$ Q $\backslash wedge$ ¬R → S is short for (P $\backslash vee$ (Q $\backslash wedge$ (¬R))) → S.
Here is a table that shows a commonly used precedence of logical operators.
The order of precedence determines which connective is the "main connective" when interpreting a non-atomic formula.
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#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.
if (P) then Q;
& ∨ ¬ ~ → ⊃ ≡ | ∀ ∃ ⊤ ⊥ ⊢ ⊨ ∴ ∵
he:קשר לוגי
Cryptography, Computer programming, Two's complement, Central processing unit, Computer architecture
Unix, Computer programming, Status register, Boolean algebra, Bit field