 
Summary: Tutch User's Guide
Version 0.52 beta
Andreas Abel
Copyright c
2000 Andreas Abel
Chapter 1: Introduction 1
1 Introduction
Nomen est omen: Tutch is an abbreviation of Tutorial proof checker. Tutch is a checker
for the validity of formal proofs in constructive logic. It is still under development, but it is
aimed towards handling rstorder predicate logic with a few builtin inductive data types
and recursive functions over these data types. The strength of the system will be the same
as of Heyting Arithmetic (HA).
Tutch is meant to be a tool to assist teaching of logic. It should help students to learn
how to formally prove propositions. We believe this is easier if they are allowed to write
down the proof like the code of a program and let it be checked afterwards in a compilerlike
tool, instead of trying to assemble it with "hands tied" in an interactive system, where they
have to search for the appropriate tactics and apply them in the right order.
We try to develop userfriendly error messages. Any feedback on cryptic messages
