Proofs: Logical Equivalence and Inference Rules

In course

In mollit ea mollit nulla cupidatat ipsum aliqua sunt qui. Incididunt magna mollit ad cupidatat tempor veniam commodo eu ipsum in enim tempor pariatur. Reprehenderit irure nulla voluptate id. Ea qui occaecat ullamco do sunt aute cillum nostrud est amet velit pariatur eu sunt. Est consequat qui commodo nisi consectetur minim mollit eiusmod ea veniam. Consectetur et ipsum laborum sint commodo do. Eu laboris ullamco ad aliquip aliqua dolor ex in ipsum voluptate consequat excepteur nostrud minim.

Description

This lecture covers the concept of logical equivalence in proofs, including how to show an argument is correct using truth tables and inference rules for propositional and predicate logic. It also discusses direct proofs, proof by contraposition, contradiction, and cases.

Official source

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

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

Related lectures (62)