Propositional Equivalence, Tautologies, Contradictions, and Contingencies in Discrete Mathematics

An overview of key concepts in logic including propositional equivalence, tautologies, contradictions, and contingencies, with a focus on their roles in discrete mathematics and philosophical logic.

Propositional Equivalence, Tautologies, Contradictions, and Contingencies in Discrete Mathematics
Propositional Equivalence, Tautologies, Contradictions, and Contingencies in Discrete Mathematics

About this video

In philosophy and logic, contingency is the status of propositions that are neither true under every possible valuation (i.e. tautologies) nor false under every possible valuation (i.e. contradictions). A contingent proposition is neither necessarily true nor necessarily false. Tautologies and Contradictions. Definition: A formula is said to be a Tautology if every truth assignment to its component statements results in the formula being true. A formula is said to be a Contradiction if every truth assignment to its component statements results in the formula being false.

Video Information

Views

788

Likes

19

Duration

37:15

Published

Apr 9, 2020

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.