Kazushige Terui

According to our database, Kazushige Terui authored at least 31 papers between 1999 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics.

Kazushige Terui

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Algebraic proof theory: Hypersequents and hypercompletions.

Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui

Ann. Pure Appl. Log., 2017

2016

Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule..

Ryota Akiyoshi, Kazushige Terui

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

Parsimonious Types and Non-uniform Computation.

Damiano Mazza, Kazushige Terui

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2013

Intersection Types for Normalization and Verification (Invited Talk).

Kazushige Terui

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Algebraic proof theory for substructural logics: Cut-elimination and completions.

Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui

Ann. Pure Appl. Log., 2012

Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus.

Kazushige Terui

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2011

On the Meaning of Focalization.

Michele Basaldella, Alexis Saurin, Kazushige Terui

Proceedings of the Ludics, Dialogue and Interaction - PRELUDE Project, 2011

Computational ludics.

Kazushige Terui

Theor. Comput. Sci., 2011

Disjunction property and complexity of substructural logics.

Rostislav Horcík, Kazushige Terui

Theor. Comput. Sci., 2011

Proof Theory and Algebra in Substructural Logics.

Kazushige Terui

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

2010

From Focalization of Logic to the Logic of Focalization.

Michele Basaldella, Alexis Saurin, Kazushige Terui

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

On the meaning of logical completeness

Michele Basaldella, Kazushige Terui

Log. Methods Comput. Sci., 2010

Church => Scott = Ptime: an application of resource sensitive realizability

Aloïs Brunel, Kazushige Terui

Proceedings of the Proceedings International Workshop on Developments in Implicit Computational complExity, 2010

Infinitary Completeness in Ludics.

Michele Basaldella, Kazushige Terui

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Light types for polynomial time computation in lambda calculus.

Patrick Baillot, Kazushige Terui

Inf. Comput., 2009

Expanding the Realm of Systematic Proof Theory.

Agata Ciabattoni, Lutz Straßburger, Kazushige Terui

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

From Axioms to Analytic Rules in Nonclassical Logics.

Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.

Vincent Atassi, Patrick Baillot, Kazushige Terui

Log. Methods Comput. Sci., 2007

Which structural rules admit cut elimination? An algebraic criterion.

Kazushige Terui

J. Symb. Log., 2007

Light affine lambda calculus and polynomial time strong normalization.

Kazushige Terui

Arch. Math. Log., 2007

2006

Towards a Semantic Characterization of Cut-Elimination.

Agata Ciabattoni, Kazushige Terui

Stud Logica, 2006

Intuitionistic phase semantics is almost classical.

Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui

Math. Struct. Comput. Sci., 2006

Modular Cut-Elimination: Finding Proofs or Counterexamples.

Agata Ciabattoni, Kazushige Terui

Proceedings of the Logic for Programming, 2006

Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.

Vincent Atassi, Patrick Baillot, Kazushige Terui

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

A Feasible Algorithm for Typing in Elementary Affine Logic.

Patrick Baillot, Kazushige Terui

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

2004

Light Affine Set Theory: A Naive Set Theory of Polynomial Time.

Kazushige Terui

Stud Logica, 2004

Proof Nets and Boolean Circuits.

Kazushige Terui

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

On the Computational Complexity of Cut-Elimination in Linear Logic.

Harry G. Mairson, Kazushige Terui

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2001

Light Affine Calculus and Polytime Strong Normalization.

Kazushige Terui

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

1999

The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.

Mitsuhiro Okada, Kazushige Terui

J. Symb. Log., 1999