InteractiveAccessibility not checkedPublished

The Complexity of Negation

By Alex Korablev · Computer science · Propositional Logic · Graduate · Formal mathematics · version 3

A formal-logic companion on negating sentences precisely: connectives, a truth-table builder, De Morgan's laws and the meaning of "unless".

Report this artifact

Reports are anonymous. The artifact stays up until we've checked it.

Licence: CC BY 4.0

Topicsnegationde morgan's lawstruth tablespropositional logicconditionals

Assumption ledger

  • simplificationClassical two-valued propositional logic; 'unless' is read as inclusive or, i.e. not-F implies Y
  • interpretation'A only if B' is symbolised A → B; 'neither/nor' as ¬(P ∨ Q); 'but' as ∧
  • parameterTruth-table builder has 8 rows and 3 student columns (24 cells)
  • dataNo data: sentences come from the CS350 Session 3 study guide
  • parameterQuiz option order is shuffled by the seed stored in state (default 20240)

Breakout check

✓ Ready for breakouts: every control we tried showed teammates the same thing.

Cite this

Alex Korablev (2026). The Complexity of Negation [Interactive model], version 3. Ideas at Play. https://ideasatplay.org/play/the-complexity-of-negation-68e250?v=3 (CC BY 4.0)

History

  1. v3Added window.artifact (getState, setState, onChange, controls, responses, assertions) with every student-changeable value in one state object, rendered from state, with localStorage removed. (generated, Oct 20, 2026)current
  2. v2Darkened the secondary text color (and the lit-lamp status text) so all text meets WCAG AA 4.5:1 contrast; nothing else changed. (generated, Oct 19, 2026)View
  3. v1Imported; lineage before import is not available. (imported, Oct 19, 2026)View

Comments

No comments yet.

Sign in to comment or like.