|
This page contains a series of JavaScript programs which can be
used for interactive training of basic mathematical logic. Look in the
table for the animation of your choice and click the button.
Warning:
The scripts are developed for use with a Netscape 4.x browser (communicator
or navigator).
Most animations can be used with Internet Explorer 4.x browser as well (not
the Turing machines).
The manual texts which come with the animations are in DUTCH, since most
of them were used for introductory courses at the U. of Amsterdam. English versions
will be available in the near future.
© 98-99 Jan Jaspars for
H o l l a n d
|
|
|
|
|
The propositional calculator is a machine
which computes the models and countermodels of
a given propositional formula.
|
|
The truth-value tabulator computes the table of
truth-values of a given propositional formula step by step.
|
|
The update & testcalculator eliminates possible
models/worlds by propositional input.
|
|
|
The predicate calculator evaluates
predicate logical formulae on a given model, and
finds positive and negative instances for free variables
|
|
The modelconstructor & evaluator enables the user
to construct a model and then evaluate first-order formulae. The reverse
order is also possible.
|
|
|
|
|
A possible world calculator which computes
which worlds in a given Kripke model verify a given modal
formula.
|
|
A possible world creator and calculator with which one can
make one's own possible world model, and then evaluate a modal formula
(Modal Logic Course, Johan van Benthem, Stanford, April 99).
|
|
|
A transitioncalculator which computes the transition
(denotation) of a given regular expression.
|
|
An extension of the transition calculator with tests.
|
|
|
|
The lone rearranger is a simple Turing machine which
sorts a sequence of a's and b's alphabetically.
|
|
The square Turing machine rewrites an input string of a's to
a string of a's of square length.
|
|
The stereo square Turing machine squares faster by using two
tapes and two heads.
|
|
|
