Katalin  Bimbó Author of Evaluating Organization Development
FEATURED AUTHOR

Katalin Bimbó

Professor
University of Alberta, Department of Philosophy

My main research interests are in the field of nonclassical logics (e.g. combinatory, relevance, modal, substructural and structurally free logics). J. Michael Dunn and I solved (in 2010) a long-open problem concerning the decidability of the logic of implicational ticket entailment. In 2014, I proved MELL (the multiplicative-exponential fragment of linear logic) decidable. J. M. Dunn and I extended the latter result to full linear logic. All these decidability results rely on sequent calculi.

Biography

I work at the University of Alberta in Canada.  Earlier, I held academic positions at other universities including Indiana University Bloomington (USA), Victoria University of Wellington (New Zealand) and the Australian National University (Australia).

Areas of Research / Professional Expertise

    Logic (mathematical, computational and philosophical)

Websites

Books

Featured Title
 Featured Title - Proof Theory Sequent Calculi and Related Formalisms - 1st Edition book cover

Articles

 Theoretical Computer Science

The decidability of the intensional fragment of classical linear logic


Published: Jun 01, 2015 by Theoretical Computer Science
Authors: Katalin Bimbo

This paper shows the decidability of the intensional fragment of classical linear logic (which is sometimes called MELL for "multiplicative-exponential linear logic").

Journal of Symbolic Logic

On the decidability of implicational ticket entailment


Published: Mar 01, 2013 by Journal of Symbolic Logic
Authors: Katalin Bimbo and J. Michael Dunn
Subjects: Mathematics

The authors solve -- positively -- the problem of the decidability of pure ticket entailment. The decidability proof utilizes sequent calculi that the authors introduced specifically to obtain this result.

Notre Dame Journal of Formal Logic

New consecution calculi for R->t


Published: Dec 01, 2012 by Notre Dame Journal of Formal Logic
Authors: Katalin Bimbo and J. Michael Dunn
Subjects: Mathematics

The paper introduces several new sequent calculi for relevance logics such as pure relevant implication and pure ticket entailment with t (intensional truth). The authors prove that the cut rule is admissible in each calculus.