JAIST Logic@JAIST

A theory of computable functionals

  • Prof. Dr. Helmut Schwichtenberg

  • Ludwig-Maximilians-Universitaet Muenchen, Germany

  • Homepage
Date: 2014/03/06 (Thu) 15:10 to 16:40
Place: JAIST, Lecture room I1
Group: Logic Unit
Based on T+ we define a logical language whose quantifiers range over partial continuous functionals and whose predicates are inductively defined. We obtain a theory TCF of computable functionals by adding introduction and elimination axioms for inductive predicates to minimal logic. TCF admits a realizability interpretation (by terms in T+) and a soundness theorem can be proved.
Contact Hajime Ishihara