Universiteit van Amsterdam

Events

Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

1 March 2001, Computational Logic Seminar, Edwin Mares

1 March 2001, Computational Logic Seminar, Edwin Mares
Speaker: Edwin Mares (Victoria University of Wellington)
Title: Provability and Relevance
Date and Time: March 1, 2001, 15.15
Location: Room P.327, ILLC, Plantage Muidergracht 24, Amsterdam

Abstract:
R# is a version of Peano arithmetic based on the relevant logic R. A startling feature of R# is that it can be shown using a finite model that 0=1 is not provable in it. This raises the question of the status of Goedel's second incompleteness theorem in R#. Unfortunately, this question has proved extremely difficult to answer. This paper will explore this problem and a series of related problems to do with provability predicates in relevant arithmetic. These results show that Loeb's theorem is particularly dangerous from a relevant point of view.

This talk will presuppose no knowledge of relevant logic -- everything you need to know about relevance will be explained. It will, however, assume some basic familiarity with Peano arithmetic and Goedel's incompleteness theorems.

For more information, see http://www.illc.uva.nl/~mdr/ACLG/Local/seminar01-1.html.

Please note that this newsitem has been archived, and may contain outdated information or links.