Kazushige Terui

发表

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

Ryota Akiyoshi, Kazushige Terui, 2016, FSCD.

On the Meaning of Logical Completeness

Kazushige Terui, Michele Basaldella, 2009, TLCA.

The finite model property for various fragments of intuitionistic linear logic

Kazushige Terui, Mitsuhiro Okada, M. Okada, 1999, Journal of Symbolic Logic.

Infinitary Completeness in Ludics

Kazushige Terui, Michele Basaldella, 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

On the Meaning of Focalization

Kazushige Terui, Alexis Saurin, Michele Basaldella, 2011, PRELUDE Project.

Light Logic and Polynomial Time Computation

Kazushige Terui, Misao Nagayama, K. Terui, 2004 .

Intuitionistic phase semantics is almost classical

Kazushige Terui, Max I. Kanovich, Mitsuhiro Okada, 2006, Mathematical Structures in Computer Science.

From Focalization of Logic to the Logic of Focalization

Kazushige Terui, Alexis Saurin, Michele Basaldella, 2010, MFPS.

Expanding the Realm of Systematic Proof Theory

Kazushige Terui, Lutz Straßburger, Agata Ciabattoni, 2009, CSL.

Disjunction property and complexity of substructural logics

Kazushige Terui, Rostislav Horcík, K. Terui, 2011, Theor. Comput. Sci..

MacNeille completion and Buchholz' Omega rule for parameter-free second order logics

Kazushige Terui, 2018, CSL.

On the Meaning of Logical Completeness

Kazushige Terui, Michele Basaldella, K. Terui, 2009, TLCA.

Intersection Types for Real Number Computation: Invited Talk at the Eighth Workshop on Intersection Types and Related Systems

Kazushige Terui, 2017 .

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

Kazushige Terui, Aloïs Brunel, 2010, DICE.

From Axioms to Analytic Rules in Nonclassical Logics

Kazushige Terui, Agata Ciabattoni, Nikolaos Galatos, 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

Which structural rules admit cut elimination? An algebraic criterion

Kazushige Terui, K. Terui, 2005, Journal of Symbolic Logic.

Algebraic proof theory: Hypersequents and hypercompletions

Kazushige Terui, Agata Ciabattoni, Nikolaos Galatos, 2017, Ann. Pure Appl. Log..

Modular Cut-Elimination: Finding Proofs or Counterexamples

Kazushige Terui, Agata Ciabattoni, 2006, LPAR.

Proof Theory and Algebra in Substructural Logics

Kazushige Terui, 2011, TABLEAUX.

Light types for polynomial time computation in lambda calculus

Kazushige Terui, Patrick Baillot, 2009, Inf. Comput..

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

Kazushige Terui, Patrick Baillot, Vincent Atassi, 2007, Log. Methods Comput. Sci..

Proof nets and Boolean circuits

Kazushige Terui, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Intersection Types for Normalization and Verification (Invited Talk)

Kazushige Terui, 2013, FSTTCS.

On the Computational Complexity of Cut-Elimination in Linear Logic

Kazushige Terui, Harry G. Mairson, 2003, ICTCS.

Light affine lambda calculus and polytime strong normalization

Kazushige Terui, K. Terui, 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

Light affine lambda calculus and polynomial time strong normalization

Kazushige Terui, 2007, Arch. Math. Log..

A Feasible Algorithm for Typing in Elementary Affine Logic pdf

Kazushige Terui, Patrick Baillot, 2005, TLCA.

Towards a Semantic Characterization of Cut-Elimination

Kazushige Terui, Agata Ciabattoni, A. Ciabattoni, 2006, Stud Logica.

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

Kazushige Terui, Agata Ciabattoni, Nikolaos Galatos, 2012, Ann. Pure Appl. Log..

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

Kazushige Terui, Patrick Baillot, Vincent Atassi, 2006, CSL.

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

Kazushige Terui, 2012, RTA.

Parsimonious Types and Non-uniform Computation

Kazushige Terui, Damiano Mazza, 2015, ICALP.

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

Kazushige Terui, 2004, Stud Logica.

Light types for polynomial time computation in lambda-calculus

Kazushige Terui, Patrick Baillot, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Computational ludics

Kazushige Terui, 2011, Theor. Comput. Sci..

Completeness Proofs for Linear Logic Based on the Proof Search Method(Preliminary Report)(Type Theory and its Applications to Computer Systems)

Kazushige Terui, Mitsuhiro Okada, M. Okada, 1998 .

Labelled Tableau Calculi Generating Simple Models for Substructural Logics

Kazushige Terui, K. Terui, 2004 .

Proof nets and Boolean circuits

Kazushige Terui, 2004, LICS 2004.

Light types for polynomial time computation in lambda-calculus

Kazushige Terui, Patrick Baillot, 2004, LICS 2004.

MacNeille completions of FL-algebras

Kazushige Terui, Agata Ciabattoni, Nikolaos Galatos, 2011 .