\begin{theindex}

  \item {\ptt ARITH\_CONV}, 5
  \item {\ptt ARITH\_FORM\_NORM\_CONV}, 7

  \indexspace

  \item Bledsoe, 2

  \indexspace

  \item completeness, 1, 2
  \item {\ptt COND\_ELIM\_CONV}, 8
  \item conditional statements, 1

  \indexspace

  \item depth conversion, 4
  \item {\ptt DISJ\_INEQS\_FALSE\_CONV}, 9

  \indexspace

  \item efficient proof procedures, 2
  \item {\ptt EXISTS\_ARITH\_CONV}, 10

  \indexspace

  \item false
    \subitem proof of, 3
  \item {\ptt FORALL\_ARITH\_CONV}, 11
  \item free variables, 1

  \indexspace

  \item goals, 3

  \indexspace

  \item help
    \subitem updating search path, 2
  \item Hodes, 1

  \indexspace

  \item {\ptt INSTANCE\_T\_CONV}, 12
  \item instances, 1
  \item integral properties, 1
  \item {\ptt is\_prenex}, 13
  \item {\ptt is\_presburger}, 14

  \indexspace

  \item linear arithmetic, 1
  \item {\ptt load\_library}, 2

  \indexspace

  \item multiplication, 1

  \indexspace

  \item natural numbers, 1
  \item {\ptt NEGATE\_CONV}, 15
  \item negation, 3
  \item {\ptt non\_presburger\_subterms}, 15
  \item normalisation, 1

  \indexspace

  \item prenex normal form, 1
  \item {\ptt PRENEX\_CONV}, 16
  \item preprocessors, 1
  \item Presburger arithmetic, 1
  \item products, 1
  \item proving false, 3

  \indexspace

  \item quantifiers
    \subitem existential, 1, 2
    \subitem universal, 1

  \indexspace

  \item satisfaction of formulae, 2
  \item Shostak, 2
  \item {\ptt SUB\_AND\_COND\_ELIM\_CONV}, 17
  \item substitution instances, 1
  \item subtraction, 1
  \item SUP-INF method, 2

  \indexspace

  \item tactics, 4

  \indexspace

  \item variable elimination, 1

  \indexspace

  \item witnesses, 2

\end{theindex}
