Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Propositional calculus

Related lectures (30)

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

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

Explores the importance of soundness and completeness in a propositional proof system.

Covers the basics of propositional logic, logical connectives, truth tables, and compound propositions.

Explores propositions, proofs, and contraposition in mathematical theory, emphasizing logical rules and proof methods.

Covers propositions, logical connectives, truth tables, and propositional logic language.

Covers propositional logic, logical connectives, truth tables, and compound propositions.

Covers translating natural language to propositional logic and proving tautologies.

Explores finite transition systems, propositional logic, truth interpretation, satisfiability, and boolean function representation with circuits.

Covers the basics of propositional logic and explores logical equivalences and proof techniques.

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

Explores the relationship between logic proofs and programming evidence through the Curry-Howard Correspondence.

Explains constructing DNF and CNF in propositional logic and their complexity.

Explains variables, predicates, propositional functions, and quantifiers in predicate logic.

Covers the concept of formal proof systems, their structure, and soundness.

Covers sets, propositional language, reading, writing, containment, and cardinality.

Explores completeness in propositional logic, resolution on clauses, conjunctive form, unit resolution, SAT solvers, and proof generation.

Covers logical connectives, implication, biconditional, and compound propositions in propositional logic.

Offers a tutorial on Coq, covering inductive definitions, recursive functions, propositions, theorems, and tactics.

Explores encoding finite systems with boolean functions, propositional logic, inductive invariants, and formal proof systems.