%% $Id$
\documentclass[11pt,a4paper]{report}
\usepackage{graphicx,../iman,../extra,../ttbox,../proof,../rail,latexsym,../pdfsetup}
%%% 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 \\
\texttt{lcp@cl.cam.ac.uk}\\[3ex]
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, GR/M75440) and by ESPRIT (projects 3245:
Logical Frameworks, and 6453: Types) and by the DFG Schwerpunktprogramm
\emph{Deduktion}.}
}
\newcommand\subcaption[1]{\par {\centering\normalsize\sc#1\par}\bigskip
\hrule\bigskip}
\newenvironment{constants}{\begin{center}\small\begin{tabular}{rrrr}}{\end{tabular}\end{center}}
\makeindex
\underscoreoff
\setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} %% {secnumdepth}{2}???
\pagestyle{headings}
\sloppy
\binperiod %%%treat . like a binary operator
\begin{document}
\maketitle
\begin{abstract}
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.
\end{abstract}
\pagenumbering{roman} \tableofcontents \clearfirst
\input{../Logics/syntax}
\include{FOL}
\include{ZF}
\bibliographystyle{plain}
\bibliography{../manual}
\printindex
\end{document}