Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.
Concept
Conjonction logique
Résumé
In logic, mathematics and linguistics, and () is the truth-functional operator of conjunction or logical conjunction. The logical connective of this operator is typically represented as or or (prefix) or or in which is the most modern and widely used.
The and of a set of operands is true if and only if all of its operands are true, i.e., is true if and only if is true and is true.
An operand of a conjunction is a conjunct.
Beyond logic, the term "conjunction" also refers to similar concepts in other fields:
In natural language, the denotation of expressions such as English "and";
In programming languages, the short-circuit and control structure;
In set theory, intersection.
In lattice theory, logical conjunction (greatest lower bound).
And is usually denoted by an infix operator: in mathematics and logic, it is denoted by (Unicode ), or ; in electronics, ; and in programming languages, &, &&, or and. In Jan Łukasiewicz's prefix notation for logic, the operator is , for Polish koniunkcja.
Logical conjunction is an operation on two logical values, typically the values of two propositions, that produces a value of true if and only if (also known as iff) both of its operands are true.
The conjunctive identity is true, which is to say that AND-ing an expression with true will never change the value of the expression. In keeping with the concept of vacuous truth, when conjunction is defined as an operator or function of arbitrary arity, the empty conjunction (AND-ing over an empty set of operands) is often defined as having the result true.
The truth table of :
In systems where logical conjunction is not a primitive, it may be defined as
or
As a rule of inference, conjunction introduction is a classically valid, simple argument form. The argument form has two premises, and . Intuitively, it permits the inference of their conjunction.
Therefore, A and B.
or in logical operator notation:
Here is an example of an argument that fits the form conjunction introduction:
Bob likes apples.
Bob likes oranges.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.