[Ter08d] |
Towards a logical foundation of computational complexity.
Logic Colloquium 2008. University of Bern, July 2008.[ bib | http | .pdf ] |

[Ter08a] |
Computational ludics.
Réunion des groupes de travail GEOCAL et LAC. University
of Paris 13, March 2008.[ bib | http | .pdf ] |

[Ter08c] |
On space efficiency of krivine's abstract machine and pointer
abstract machine.
Workshop on Implicit Computational Complexity. University of
Paris 13, February 2008.[ bib | http | .pdf ] |

[Ter08b] |
From axioms to rules: A coalition of fuzzy, linear and substructural
logics.
23rd Incontro di Logica. Associazione di Logica e sue Applicazioni, University of Genova, February 2008. [ bib | http | .pdf ] |

[Ter07a] |
How and when axioms can be transformed into good structural rules.
Collegium Logicum: Proofs and Structures. Vienna University
of Technology, October 2007.[ bib | http | .pdf ] |

[Ter07b] |
Residuated frames: the join of proof theory and algebra for
substructural logics.
Workshop on Algebra and Logic. JAIST, March 2007.[ bib | .pdf ] |

[Ter06a] |
A direct proof of the amalgamation property for commutative
residuated lattices.
Algebra and Substructural Logics: take three. Jagiellonian
University, Krakow, November 2006.[ bib | .html | .pdf ] |

[Ter06d] |
Verification of Ptime reducibility of system F terms via dual
light affine logic.
CSL'06. Szeged, September 2006.[ bib | http | .pdf ] |

[Ter06c] |
On the use of phase semantics: to make sense out of nonsense.
University of Rome 3, June 2006. [ bib | .pdf ] |

[Ter06b] |
Intersection types for computational complexity.
Workshop on Implicit Computational Complexity (as part of
GEOCAL'06). Marseille, February 2006.[ bib | .html | .pdf ] |

[照井06] |
非古典論理におけるカット除去定理の意味論的考察.
2005年度日本数学会年会. 中央大学, 2006年3月. [ bib | http | .pdf ] |

[Ter05] |
Towards a semantic characterization of cut-elimination (joint work
with a. ciabattoni).
LDP Seminar. Institut de Mathematique de Luminy, Marseille,
September 2005.[ bib | .html | .pdf ] |

[Ter04b] |
Intuitionistic phase spaces are almost classical.
Semantics Group. PPS, University of Paris 7, September 2004.[ bib | .html | .pdf ] |

[Ter04c] |
Proof nets and boolean circuits.
LICS'04. Turku, July 2004.[ bib | http | .pdf ] |

[Ter04a] |
Decomposition of computation via linear logic.
6th International Workshop on Logic and Computational
Complexity. Turku, July 2004.[ bib | .html | .pdf ] |

[照井04] |
計算論の現在：P vs NP問題とは何か？
計算数学ワークショップ, 日本科学哲学会第37回大会. 京都大学, 2004年10月. [ bib | .html | .pdf ] |

[Ter03c] |
Pure lambda calculus as a term syntax for light affine logic.
Informal Workshop on Logic and Complexity. Bertinoro,
October 2003.[ bib | .pdf ] |

[Ter03a] |
On the computational complexity of cut-elimination in linear logic.
ICTCS'03. Bertinoro, October 2003.[ bib | http | .pdf ] |

[Ter03b] |
On the expressivity of naive set theory based on substructural
logics.
Australian National University, March 2003. [ bib | .html | .pdf ] |

[照井03a] |
線形論理 - What's the use?
数学基礎論サマースクール, 2003年9月. [ bib | .html | .pdf ] |

[照井03b] |
Linear logic and naive set theory - Make our garden grow.
数学基礎論サマースクール, 2003年9月. [ bib | .html | .pdf ] |

*This file has been generated by
bibtex2html 1.79*