**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# Propositional Logic: Basic Logical Connectives

Description

This lecture introduces the concept of propositions, logical connectives like negation, conjunction, and disjunction, truth tables, and the language of propositional logic. It covers the construction of compound propositions and the use of atomic propositions.

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

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

Related concepts (65)

Related lectures (73)

Propositional calculus

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

Proposition

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.

Atomic formula

In mathematical logic, an atomic formula (also known as an atom or a prime formula) is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformulas. Atoms are thus the simplest well-formed formulas of the logic. Compound formulas are formed by combining the atomic formulas using the logical connectives.

Logical form

In logic, logical form of a statement is a precisely-specified semantic version of that statement in a formal system. Informally, the logical form attempts to formalize a possibly ambiguous statement into a statement with a precise, unambiguous logical interpretation with respect to a formal system. In an ideal formal language, the meaning of a logical form can be determined unambiguously from syntax alone. Logical forms are semantic, not syntactic constructs; therefore, there may be more than one string that represents the same logical form in a given language.

Logical constant

In logic, a logical constant or constant symbol of a language is a symbol that has the same semantic value under every interpretation of . Two important types of logical constants are logical connectives and quantifiers. The equality predicate (usually written '=') is also treated as a logical constant in many systems of logic.

Propositional Logic: Equivalence and Normal Forms

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

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

Covers the basics of propositional logic, its history, language, and computing applications.

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

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

Discrete Mathematics: Logic & Structures

Covers propositional logic, truth tables, and problem-solving strategies in discrete mathematics.

Discrete Mathematics: Logic, Structures, AlgorithmsCS-101: Advanced information, computation, communication I

Covers the basics of discrete mathematics, including logic, structures, and algorithms.