Lecture

Discrete Mathematics: Logic, Structures, Algorithms

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture introduces the basics of discrete mathematics, focusing on logic, structures, and algorithms. It covers propositional logic, truth tables, logical connectives, compound propositions, and implications. The course aims to provide a foundation for understanding computer systems and computational thinking, emphasizing problem-solving and scalability analysis without programming. Topics include sets, functions, relations, sequences, complexity of algorithms, counting, and probability theory. The teaching approach involves interactive sessions, quizzes, and group discussions. Students are encouraged to actively participate, follow the schedule, and engage in problem-solving. The course material closely follows the book 'Discrete Mathematics and Its Applications' by Kenneth H. Rosen.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Logic

Classical logic: First-order logic

Related concepts (32)

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.

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.

Propositional formula

In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be called a propositional expression, a sentence, or a sentential formula. A propositional formula is constructed from simple propositions, such as "five is greater than three" or propositional variables such as p and q, using connectives or logical operators such as NOT, AND, OR, or IMPLIES; for example: (p AND NOT q) IMPLIES (p OR q).

Probability

Probability is the branch of mathematics concerning numerical descriptions of how likely an event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speaking, 0 indicates impossibility of the event and 1 indicates certainty. The higher the probability of an event, the more likely it is that the event will occur. A simple example is the tossing of a fair (unbiased) coin.

Probability theory

Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expressing it through a set of axioms. Typically these axioms formalise probability in terms of a probability space, which assigns a measure taking values between 0 and 1, termed the probability measure, to a set of outcomes called the sample space.

Related lectures (64)

Discrete Mathematics: Logic, Structures, Algorithms

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

Concept of Proof in Mathematics

Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.

Course Overview: Teaser on Course Contents

Offers an overview of propositional and predicate logic, sets, functions, relations, algorithms, Swiss cities, sorting tables, Covid infections, poker hands, and prime numbers.

Sets and Functions

Introduces sets and functions, covering union, intersection, complement, functions terminology, and set operations analogies.

Sets and Operations: Introduction to Mathematics