Research interests
Recent talks
Organisational works


Research Activities of Naohi Eguchi
Research interests
 Proof complexity (including bounded arithmetic and ordinaltheoretic proof theory)
 Complexity analysis by term rewriting
 Implicit computational complexity
In particular recursiontheoretic and termrewriting characterisations of computational complexity classes
Recent talks
 Formalizing Termination Proofs under Polynomial Quasiinterpretations
 September 11, 2015, 10th International Workshop on Fixed Points in Computer Science, Berlin, Germany
 Formalizing Termination Proofs under Quasiinterpretations Optimally
 September 8, 2015, 43rd TRS Meeting, Morioka, Japan
 Formalizing Termination Proofs under Polynomial Quasiinterpretations
 July 5, 2015, 16th International Workshop on Logic and Computational Complexity, Kyoto, Japan
 Derivational Complexity vs. Minimal Function Graphs
 February 7, 2015, 42nd TRS Meeting, Tokyo, Japan
 Formalising Termination Proofs with Polynomial Quasiinterpretations in Bounded Arithmetic
 December 24, 2014, RIMS, Kyoto, Japan
 Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
 September 27, 2014, 41st TRS Meeting, Jozankei, Sapporo, Japan
Organisational works
 12th International Conference on Computability and Complexity in Analysis
 July 12  15, 2015, Meiji University, Japan
Organising committee member
 6th International Workshop on Developments in Implicit Computational Complexity (DICE 2015)
 April 12, 2015, Queen Mary University of London, London, UK
PC member
 Computability Theory and Foundations of Mathematics (CTFM 2013)
 February 18  20, 2013, Tokyo Institute of Technology, Tokyo, Japan
Organising committee member
 Workshop on Proof Theory and Computability Theory 2012  Philosophical Frontiers in Reverse Mathematics
 February 20  23, 2012. Harumi Grand Hotel, Tokyo, Japan
Organising committee member
 Workshop on Proof Theory and Computability Theory
 February 2011, Akiu Spa Hotel Iwanumaya, Sendai, Japan.
Local organising committee member
