Discrete Mathematics for Computer Science: Logic and Sets

HKUST establishes the language used to state and reason about discrete problems. Propositional and predicate logic lead into rules of inference, sets and functions. It suits beginners who want to understand how a mathematical statement is structured before progressing to counting, algorithms or recursion, and who prefer a focused foundations course.

What you will learn

• Translate statements into propositional and predicate logic.
• Apply inference rules and inspect arguments.
• Work with sets, relations and functions.

Who this suits

Beginners building mathematical foundations for computer science, with time to practice notation and explain why each inference follows.

Before you enroll

Work through examples with a written argument rather than relying on an answer alone. Check definitions, quantifiers and boundary cases, and distinguish a model’s assumptions from the situation it represents. These courses take different routes through discrete mathematics; compare their preparation requirements and topic coverage before choosing a starting point.

Coursera offers paid enrollment or subscription access. Check the enrollment screen for assessment and certificate terms, trials and any financial-aid options. Provider access terms can change; review them before paying.

Put it into practice

Write a statement about a small set in words and in logical notation. Test it with examples, negate it carefully and explain the effect of changing the quantifiers.

Source and review

This overview is based on the provider's published information, checked on 12 October 2026. It is an editorial assessment, not a claim that we completed the resource. Time filters are approximate study ranges; projects and exercises can take longer.

View the curriculum and current access options at Coursera.

How YellowCourse describes and checks learning resources.