Many problems in logic require the use of parse trees, and their evaluation as truth tables: for example, testing equivalence and modelling. Incorporating these into Numbas would require a sophisticated approach to parsing logical statements: I’ll briefly talk about an alternative method for building questions on this material, using a JavaScript extension to produce and manipulate complicated logical statements.