Lecture

Propositional Calculus

Description

This lecture covers the fundamentals of formal logic and theoretical computer science, including the basics of propositional calculus, effective procedures, and complexity theory. Topics include predicate calculus, set theory, proofs, NP-completeness, and the importance of studying propositional calculus.

Official source

https://mediaspace.epfl.ch/media/0_byd0ucyo

About this result

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.

Ontological neighbourhood

Logic

Classical logic: First-order logic

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (30)

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.