Logic and Foundations

Maintained by Christian Gottschall, Vienna philosophy department.

Includes an introduction to logic and formal systems, revolving around the Mizar proof checker, and a guide to Mizar.

(Hyper)textbook for students in mathematical logic, by Karlis Podnieks.

A closed, moderated, e-mail list for discussing Foundations of Mathematics moderated by Martin Davis. Archive available.

Homepage of a lecture course by Natasha Alechina, with a particular emphasis on topics relevant to computer science, such as bisimulation.

Boise State University - Set theory: New Foundations, automated theorem proving.

Carnegie Mellon University - Model theory, set theory, foundations of logic and mathematics, symbolic mathematical computation.

Queen Mary and Westfield College - Categorical logic and the semantics of programming languages and type theories.

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

Project to keep the book (also named in the title), describing forms related to the Axiom of Choice and their implications, updated.

Takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and clause formation rules for this logic.

A generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). Includes logic, documentation and free download.

Program understands the different types of lambda expressions, can extract lists of variables (both free and bound) and subterms, and can simplify complicated expressions. Uses Python.

A successor to the proof editor Alf with a graphical user interface, being developed at the Programming Logic Group at Chalmers. Available for download.

University of East Anglia, Norwich; 7--9 September 2000.

Tokyo, Japan, May 16-19, 2003. Photographs.

Sixteenth International Conference on Logic Programming. Las Cruces, New Mexico; 29 November -- 4 December, 1999.

Logical Foundations of Mathematics, Computer Science and Physics -- Kurt Gödel's Legacy. Brno, Czech Republic; 25--29 August 1996.

Saratoga Springs, NY, USA; 7--11 June 1999.

Conference on Computational Logic. Incorporating DOOD2000 and LOPSTR2000, collocated with ILP2000. Imperial College, London, UK; 24--28 July 2000.

The 17th International Conference on Automated Deduction. Pittsburgh, PA, USA; 17--20 June 2000.

Seventeenth International Conference on Logic Programming. Paphos, Cyprus; 26 November -- 1 December 2001.

International Conference on Logic Programming. Copenhagen, Denmark; 29 July -- 1 August 2002.

6th Workshop on Logic, Language, Information and Computation. Hotel Simon, Itatiaia National Park, Rio de Janeiro, Brazil; 25--28 May 1999. Abstracts.

Analysis of a ripple adder in binary logic and alternative designs in ternary and multi-value logics.

A section of the SWIF map of logic on the WWW. Resources are in English and Italian.

List of publications and websites on axiomatic set theories.

Unofficial bibliography as part of Hypertext Bibliography Project.

Mathematical Logic Team. [Flags are language selectors]

Background, objectives, members and workshops.

Laboratory for Logic,Databases and Advanced Programming.

Biographical entry in the FOLDOC.

Home page of a working group maintained by Thierry Coquand.

A definition of the concept.

Disseratation by Mads Dan, investigating the general model theory of propositional relevance logic.

Mathematical Logic Group. Research areas: recursion theory, model theory, set theory and foundations, proof theory, and in applications to algebra, analysis and theoretical computer science. Members, events, seminars.

Article by G. Barthe, J. Hatcliff, and M.H. Sørensen which presents a CPS translation to Barenderegt's `cube' of pure type systems, and applies this to provide a formulae-as-types correspondence for higher-order classical predicate logic.

Article by C.-H. L. Ong and C. A. Stewart which presents a call-by-name variant of Parigot's lambda-mu calculus. The calculus is proposed as a foundation for first-class continuations and statically scoped exceptions in functional programming languages.

ITT Industries, Inc., USA.

RMIT University, Australia.