Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Mathematics · unit version 1

Boolean specifications, certificates and circuits

Turn a finite specification into logical formulas, distinguish witnesses from universal certificates, and prove circuit correctness with an explicit work/depth model. Normal forms provide supporting depth.

Open any lesson. Completion records participation; automatic practice checks and human judgment of written arguments are separate. This unit retains its own versioned requirements.

Readiness and preparation

Check your starting point

Try these short questions on paper, then compare your reasoning. They are optional self-checks, not a placement score or a navigation requirement. Use a targeted review when useful and return with your browser’s Back control.

Does one successful input prove two rules always agree?

An existential witness and a universal certificate answer different questions.

Compare reasoning and find a refresher

No. One matching row establishes agreement only there. A counterexample refutes equivalence; checking every assignment of a specified finite input set proves it on that domain.

Review domains and counterexamples

Can a formula be true whenever its premise is false?

Material implication is a truth condition, not a promise of causation.

Compare reasoning and find a refresher

Yes. A→B is false only when A is true and B false. This differs from A AND B and from the converse B→A.

Review implications and their converses

Loading saved mathematics work…

Assumptions, hidden variables and circuit families

The mixed assessment has separate response history and review criteria; it does not change lesson participation records.

Lesson sequence

Each linked lesson opens on its own page. Expand its details here when you want to check the objectives before choosing.

  1. Boolean specifications and certificates

    Lesson details and objectives

    Translate requirements into truth conditions and choose the right evidence for satisfiability, validity, equivalence and entailment.

    • Translate a concrete specification into a Boolean formula and diagnose it with intermediate truth-table columns.
    • Distinguish existential witnesses from all-assignment certificates for validity, equivalence and entailment.
    • Check consistency and environmental assumptions before interpreting a logically valid conclusion.

    8 practice tasks.

  2. Construct formulas from complete truth tables

    Lesson details and objectives

    Supporting depth: build canonical DNF and CNF, prove their meaning row by row, and separate finite decidability from efficient representation.

    • Construct complete minterms and maxterms with correct literal polarity from a specified finite truth table.
    • Prove canonical DNF and CNF equivalence for any finite variable set, including constant functions and the empty variable set.
    • Distinguish canonical representations from general nonunique normal forms and account for exponential truth-table growth.

    6 practice tasks.

  3. Prove a circuit correct and separate work from depth

    Lesson details and objectives

    Construct a bounded-fan-in alarm circuit, prove its specification for every input, and audit padding, parallel depth and shared gates.

    • Prove recursively that a binary OR tree reports whether at least one real input is one, including identity padding.
    • Derive gate work and critical-path depth under an explicit bounded-fan-in cost model.
    • Distinguish circuit equivalence from cost equivalence and justify a depth lower bound using essential inputs.

    6 practice tasks.