Propositional Equivalences and Tautologies — KopHub

Chapters

On this page & study actions

Assessed progress

Sign in and complete the verified MCQs to track mastery.

Practice this topic Next topicSpecial Connectives and Functional Completeness

Home/Sem 3/← Discrete Mathematical Structures/Mathematical logic/Propositional Equivalences and Tautologies

Unit 1: Mathematical logic5 min read

Propositional Equivalences and Tautologies

Assessed progress

Sign in and complete the verified MCQs to track mastery.

Practice this topic Next topicSpecial Connectives and Functional Completeness

Practice this subject

Continue to KopHub’s existing question and assessment experience.

PreviousFoundations of Propositional Logic Next Special Connectives and Functional Completeness

CSE/SY Sem 3

Leaderboard Calendar Playground

CSE/SY Sem 3

Leaderboard Class Schedule Code Playground Settings

Appearance

Discrete Mathematical Structures

6 Modules

Foundations of Propositional Logic Propositional Equivalences and Tautologies Special Connectives and Functional Completeness Boolean Logic and Bit Operations Operator Precedence and Polish Notation

Functions and Their Properties Binary Relations and Equivalence Posets and Hasse Diagrams Foundations of Set Theory Set Operations and Identities

Algebraic Systems and Binary Operations Semigroups and Subsemigroups Monoids and Submonoids Groups and Abelian Groups Subgroups and Homomorphisms

Introduction to Lattices and Posets Algebraic Properties and Lattice Operations Substructures, Products, and Homomorphisms Distributive, Bounded, and Complemented Lattices

Content unavailableSoon

Introduction to Graphs and Basic Properties Paths, Reachability, and Connectivity Matrix Representations of Graphs Trees and Their Properties Special Graphs, Planarity, and Theorems Practical Applications of Graphs

Discrete Mathematical Structures

6 Modules

Foundations of Propositional Logic Propositional Equivalences and Tautologies Special Connectives and Functional Completeness Boolean Logic and Bit Operations Operator Precedence and Polish Notation

Functions and Their Properties Binary Relations and Equivalence Posets and Hasse Diagrams Foundations of Set Theory Set Operations and Identities

Algebraic Systems and Binary Operations Semigroups and Subsemigroups Monoids and Submonoids Groups and Abelian Groups Subgroups and Homomorphisms

Introduction to Lattices and Posets Algebraic Properties and Lattice Operations Substructures, Products, and Homomorphisms Distributive, Bounded, and Complemented Lattices

Content unavailableSoon

Introduction to Graphs and Basic Properties Paths, Reachability, and Connectivity Matrix Representations of Graphs Trees and Their Properties Special Graphs, Planarity, and Theorems Practical Applications of Graphs

DM ADS DT CN SPM COI

MDM ElectiveMDM

Labs & ProjectsLabs