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.

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.