First-order logic

Related courses (141)

Graph Chatbot

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.

COM-622: Topics in information-theoretic cryptography

Information-theoretic methods and their application to secrecy & privacy. Perfect information-theoretic secrecy. Randomness extraction & privacy amplification. Secret key generation from common random

PHYS-758: Advanced Course on Quantum Communication

The aim of this doctoral course by Nicolas Sangouard is to lay the theoretical groundwork that is needed for students to understand how to take advantage of quantum effects for communication technolog

ENG-400: Water quality modeling

This course builds on environmental chemistry and microbiology taken in previous courses. The emphasis is on quantification using the public domain package, PHREEQC, which is an excellent computation

MATH-495: Mathematical quantum mechanics

Quantum mechanics is one of the most successful physical theories. This course presents the mathematical formalism (functional analysis and spectral theory) that underlies quantum mechanics. It is sim

CS-422: Database systems

This course is intended for students who want to understand modern large-scale data analysis systems and database systems. It covers a wide range of topics and technologies, and will prepare students

MATH-680: Monstrous moonshine

The monstrous moonshine is an unexpected connection between the Monster group and modular functions. In the course we will explain the statement of the conjecture and study the main ideas and concepts

CS-602: Foundation of probabilistic proofs

Probabilistic proof system (eg PCPs and IPs) have had a tremendous impact on the theoretical computer science, and have also found practical uses. They underlie delegation of computation protocols and

MATH-679: Group schemes

This is a course about group schemes, with an emphasis on structural theorems for algebraic groups (e.g. Barsotti--Chevalley's theorem). All the basics will be covered towards the proof of such theore

MATH-604: Some Aspects of Calculus of Variations

The goal of this course is to present an overview on the solvability and the regularity of relevant models of physical, technological and economical systems, which may be formulated as minimization pr

PENS-223: Waters within cities

Knowledge of how to articulate the "urban transition" is today urgently needed. The course reflects on the possibility of designing an urban space without negatively impacting on its water quality.