**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Logical Equivalences: De Morgan's Laws and Implications

Description

This lecture covers logical equivalences in propositional logic, including De Morgan's Laws and Equivalences with Basic Connectives. It also explores Equivalences with Implications, Contrapositive, Converse, Inverse, and the application of Logical Equivalences.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

Related concepts (33)

Related lectures (34)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

The material conditional (also known as material implication) is an operation commonly used in logic. When the conditional symbol is interpreted as material implication, a formula is true unless is true and is false. Material implication can also be characterized inferentially by modus ponens, modus tollens, conditional proof, and classical reductio ad absurdum. Material implication is used in all the basic systems of classical logic as well as some nonclassical logics.

In logic and mathematics, statements and are said to be logically equivalent if they have the same truth value in every model. The logical equivalence of and is sometimes expressed as , , , or , depending on the notation being used. However, these symbols are also used for material equivalence, so proper interpretation would depend on the context. Logical equivalence is different from material equivalence, although the two concepts are intrinsically related. In logic, many common logical equivalences exist and are often listed as laws or properties.

In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective can be used to join the two atomic formulas and , rendering the complex formula . Common connectives include negation, disjunction, conjunction, implication, and equivalence.

A proposition is a central concept in the philosophy of language, semantics, logic, and related fields, often characterized as the primary bearer of truth or falsity. Propositions are also often characterized as being the kind of thing that declarative sentences denote. For instance the sentence "The sky is blue" denotes the proposition that the sky is blue. However, crucially, propositions are not themselves linguistic expressions.

In logic and mathematics, the logical biconditional, also known as material biconditional or equivalence or biimplication or bientaiment, is the logical connective used to conjoin two statements and to form the statement " if and only if " (often abbreviated as " iff "), where is known as the antecedent, and the consequent. Nowadays, notations to represent equivalence include . is logically equivalent to both and , and the XNOR (exclusive nor) boolean operator, which means "both or neither".

Propositional Logic: Equivalence and Normal Forms

Covers propositional logic, equivalence proofs, and normal forms using truth tables.

Propositional Logic: Equivalence and Normal FormsCS-101: Advanced information, computation, communication I

Covers propositional logic, logical equivalence, tautology, contradiction, and normal forms.

Logical Equivalences: De Morgan's Laws and ImplicationsCS-101: Advanced information, computation, communication I

Covers logical equivalences in propositional logic, including De Morgan's Laws and Equivalences with Basic Connectives.

Logical Equivalences: Constructing, Proving, and ApplyingCS-101: Advanced information, computation, communication I

Covers the process of showing logical equivalences through examples and introduces De Morgan's Laws.

Propositional Logic: Basics and EquivalencesCS-101: Advanced information, computation, communication I

Covers the basics of propositional logic and explores logical equivalences and proof techniques.