[Alta-Logic] UofA Philosophy Colloquium: Feb. 9, Katalin Bimbo on Ticket Entailment

[Richard Zach]

                       UofA PHILOSOPHY COLLOQUIUM

                                    

                  On Thursday, February 9 at 3:30 p.m.

                        in Assiniboia Hall 2-02A

                                    

                             Katalin Bimbό

                        (University of Alberta)

                                    

                          will be speaking on

                                    

                 “A Solution to a 50-Year-Old Problem”

                                    

                                    

                              ALL WELCOME

                                    

                                    

Abstract:

The logic of ticket entailment was introduced by A. R. Anderson in the
early 1960s. A logic is decidable if and only if the set of its theorems
is recursive. Some relevance logics are known to be decidable, whereas
others have been shown to be undecidable.

I will present a solution to the famous open problem: the decidability
of T→ (implicational ticket entailment). The decision procedure also
solves the inhabitation problem of simple types by combinators over the
base

{B, B’, I, W}.

The results presented in this talk come from the following two papers:

(1) Bimbό, K. and J. M. Dunn, “New consecution calculi for R t→” Notre 

      Dame Journal of Formal Logic, (20 pages, to appear).

(2) Bimbό, K. and J. M. Dunn, “On the decidability of implicational
ticket 

      entailment," (18 pages, submitted for publication).

This research is funded by my SSHRC Standard Research Grant
(#410-2010-0207).




-------------- next part --------------
A non-text attachment was scrubbed...
Name: Bimbo Poster.pdf
Type: application/pdf
Size: 84002 bytes
Desc: not available
Url : http://mailman.ucalgary.ca/pipermail/alta-logic-l/attachments/20120206/89527a1a/BimboPoster.pdf