Premier ordre Logique (FOL), also known as predicate logic or first-order predicate logic, is a formal system in logique mathématique that allows for the expression of statements about objects and their relationships. It extends propositional logic by incorporating quantifiers, predicates, and variables, enabling a more nuanced representation of complex déclarations.
In FOL, statements are built using predicates, which are functions that return true or false based on the input values (objects). For example, the predicate Likes(John, Glace) states that ‘John likes ice cream.’ This allows us to express relationships between different entities and their properties.
La FOL utilise deux quantificateurs principaux : le quantificateur existentiel (∃) et le quantificateur universel (∀). Le quantificateur existentiel permet d'affirmer qu'il existe au moins un objet pour lequel un prédicat est vrai, tandis que le quantificateur universel affirme qu'un prédicat est vrai pour tous les objets d'un domaine particulier.
L'un des avantages importants de la logique du premier ordre est its ability to support reasoning through inférence logique. This means that if certain statements are true, FOL can be used to deduce new truths based on those statements using rules of inference, such as Modus Ponens or Universal Instantiation.
FOL has applications in various fields, including artificial intelligence, where it is used for représentation des connaissances and automated reasoning, as well as in computer science for database querying and in formal verification of software and hardware systems.
Despite its expressiveness, First-Order Logic is not without limitations. For instance, it cannot easily represent certain concepts like time or modality without additional frameworks. Nevertheless, it remains a foundational tool for formal reasoning and logic.