Under construction. This area is a framework being built: most courses have no teaching material yet, and things may change or break. Private self-study. Not an official programme and not recognised by any ministry or school. No qualification, mark or document is issued, and “years 1 to 3” and “advanced” are names of study paths only.
B01 Mathematical language & proof
Years 1 to 3 pathB: Years 1 to 3 coreplannedabout 120 h (planning estimate)
Draft lectures and exercises are available for this course. They were written by AI and checked by a second AI; no person has reviewed them yet. Use them as a study aid, not as an authority.
Named in: Years 1 to 3 pathway
Why this course
The entry point of the bachelor route: the language of quantifiers, sets and proofs that every later proof-based course uses.
Prerequisites
Concept-level units
Units follow the syllabus order, as a recommended sequence rather than a gate.
- Logic and quantifiers
- Sets and functions
- Relations and equivalence
- Direct and indirect proofs
- Induction and recursion
- Proof critique and counterexamples
Assessable outcome
Write correct proofs, negate quantified claims, and distinguish evidence from proof.
Assessment design
- topic exercises
- mixed problem sets
- unseen proof or derivation problems
- cumulative examination
cumulative; uses spaced retrieval
Resources
Every title here is candidate, unverified unless marked verified. Titles were suggested while planning. Nobody has checked that they exist, what they cost or how they are licensed.
- Hammack · Book of Proof
- Velleman · How to Prove It
Content record
- Version
- 0.0.0
- Review
- no review of any kind
- Provenance
- catalogue imported from the owner brief of 29 Oct 2026; no teaching content authored
- Known issues
- none recorded
- Type
- course
Bridges and laboratories
- Laboratory: Quantifier and finite-domain counterexample explorer demonstration Finite tests cannot prove an infinite-domain universal claim
You and this course
Reading your plan on this device…