gienah@gentoo.org sci-mathematics Isabelle is a generic proof assistant. It allows mathematical formulas to be expressed in a formal language and provides tools for proving those formulas in a logical calculus. The main application is the formalization of mathematical proofs and in particular formal verification, which includes proving the correctness of computer hardware or software and proving properties of computer languages and protocols. Pure is the basis for all object-logics. FOL (Many-sorted First-Order Logic) provides basic classical and intuitionistic first-order logic. It is polymorphic. (Higher-Order Logic) is a version of classical higher-order logic resembling that of the HOL System. ZF (Set Theory) offers a formulation of Zermelo-Fraenkel set theory on top of FOL. CCL (Classical Computational Logic) CTT (Constructive Type Theory) is an extensional version of Martin-Löf's Type Theory. Cube (The Lambda Cube) FOLP (FOL with Proof Terms) LCF (Logic of Computable Functions) Sequents (first-order, modal and linear logics) Generate theory browsing information, including HTML documents that show a theory's definition, the theorems proved in its ML file and the relationship with its ancestors and descendants. Use ledit for the isabelle tty line editor Use readline (rlwrap) for the isabelle tty line editor Add support for the app-emacs/proofgeneral proof assistant front end. Build Isabelle/jEdit Prover IDE (PIDE).