author wenzelm
Fri, 03 Sep 1999 16:11:03 +0200
changeset 7457 e67eed4cd224
parent 6623 021728c71030
child 7838 5aca258fedcf
permissions -rw-r--r--
fixed usepackage;

%% $Id$

%%% to index derived rls:  ^\([a-zA-Z0-9][a-zA-Z0-9_]*\)        \\tdx{\1}  
%%% to index rulenames:   ^ *(\([a-zA-Z0-9][a-zA-Z0-9_]*\),     \\tdx{\1}  
%%% to index constants:   \\tt \([a-zA-Z0-9][a-zA-Z0-9_]*\)     \\cdx{\1}  
%%% to deverbify:         \\verb|\([^|]*\)|     \\ttindex{\1}  

\title{\includegraphics[scale=0.5]{isabelle_zf} \\[4ex] 
       Isabelle's Logics: FOL and ZF}

\author{{\em Lawrence C. Paulson}\\
        Computer Laboratory \\ University of Cambridge \\
        With Contributions by Tobias Nipkow and Markus Wenzel%
\thanks{Markus Wenzel made numerous improvements.
    Philippe de Groote contributed to~\ZF{}.  Philippe No\"el and
    Martin Coen made many contributions to~\ZF{}.  The research has 
    been funded by the EPSRC (grants GR/G53279, GR/H40570, GR/K57381,
    GR/K77051) and by ESPRIT project 6453: Types.}

\newcommand\subcaption[1]{\par {\centering\normalsize\sc#1\par}\bigskip



\setcounter{secnumdepth}{2} \setcounter{tocdepth}{2}  %% {secnumdepth}{2}???

\binperiod     %%%treat . like a binary operator


This manual describes Isabelle's formalizations of many-sorted first-order
logic (\texttt{FOL}) and Zermelo-Fraenkel set theory (\texttt{ZF}).  See the
\emph{Reference Manual} for general Isabelle commands, and \emph{Introduction
  to Isabelle} for an overall tutorial.

\pagenumbering{roman} \tableofcontents \clearfirst