Online seminar on Goodstein's Theorem, transfinite ordinals, formal number theory, Wainer Hierarchy of fast-growing functions, and the Kirby-Paris Theorem.

Internet forum focused on the calculus of structures.

Full list of publications by this author, with about 30 items in the area of proof theory. Many of the papers are downloadable.

Linear Logic in Computer Science is lead by the "Logic of Programming" research team. Its thematic is focused on developing the theory and the applications of Linear Logic. It is formed by seven sites located in Marseille, Bologna, Cambridge, Edinburgh, Lisboa, Paris and Roma, and a few subsites.

The "Logic of Programming" research team is interested in proof theory and its relations with theoretical computer science. The main topic is mathematical interpretation of proofs : nets (proof = graph), denotational semantics (proof = function), and game semantics (proof = strategy). Two realisations of this working programm are Linear Logic and Ludics.

Research group based in Edinburgh, it is running on the interaction between logic, mathematics and informatics. Links to publications, homepages, reports.

Open Encyclopedia entry. Hierarchically organized by subtopics.

A survey consisting of 10 questions asked by Solomon Feferman and 29 responses.

Basic material on proof theory and the home page of the only mailing list devoted to proof theory, with hundreds of experts.

The calculus of structures is a new proof theoretical formalism. It exploits a top-down symmetry of derivations made possible by deep inference.

Discussion of David Hilbert's development of this type of logical formalism with emphasis on proof-theoretic methods.

Brief introductions to combinatory logic, the incompleteness theorems and independence results, by Andrew D Burbanks.