Propositional Calculus

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Page 2 of 3

Automated Reasoning: Formal Verification with LISA

Explores formal verification using the LISA proof assistant and the OCBSL Equivalence Checker.

Computational Complexity: Theory and Applications

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Proofs and Sets: Applications

Covers the basics of proofs, defining sets, and applications between sets.

Complex Systems: Critical Phenomena

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

Formal Proofs: Checking Invariants and Bounded Model Checking

Explores formal proofs, satisfiability problems, and inductive invariants using SAT queries in sequential circuits.

Injective Functions: Properties and Examples

Covers the properties of injective functions and demonstrates their proofs through examples and visual aids.

Understanding Equivalence Relations and Integer Construction

Covers the construction of integers through equivalence relations and their properties in mathematics.

Discrete Mathematics: Logic, Structures, Algorithms

Covers the basics of discrete mathematics, focusing on logic, structures, and algorithms for computer systems.

Set Theory: Introduction and Operations

Covers the foundation of mathematics through set theory concepts like membership and unions.

Inductive Propositions: Understanding Evaluation in Coq

Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.