 | 2009 |
|---|
| 21 |       | Agata Ciabattoni,
Lutz Straßburger,
Kazushige Terui:
Expanding the Realm of Systematic Proof Theory.
CSL 2009: 163-178 |
| 20 | | Michele Basaldella,
Kazushige Terui:
On the Meaning of Logical Completeness.
TLCA 2009: 50-64 |
| 19 | | Patrick Baillot,
Kazushige Terui:
Light types for polynomial time computation in lambda calculus.
Inf. Comput. 207(1): 41-62 (2009) |
| 2008 |
|---|
| 18 | | Agata Ciabattoni,
Nikolaos Galatos,
Kazushige Terui:
From Axioms to Analytic Rules in Nonclassical Logics.
LICS 2008: 229-240 |
| 2007 |
|---|
| 17 | | Kazushige Terui:
Light affine lambda calculus and polynomial time strong normalization.
Arch. Math. Log. 46(3-4): 253-280 (2007) |
| 16 | | Vincent Atassi,
Patrick Baillot,
Kazushige Terui:
Verification of Ptime Reducibility for system F Terms: Type Inference in<br> Dual Light Affine Logic
CoRR abs/0710.1153: (2007) |
| 15 | | Vincent Atassi,
Patrick Baillot,
Kazushige Terui:
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.
Logical Methods in Computer Science 3(4): (2007) |
| 2006 |
|---|
| 14 | | Vincent Atassi,
Patrick Baillot,
Kazushige Terui:
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.
CSL 2006: 150-166 |
| 13 | | Agata Ciabattoni,
Kazushige Terui:
Modular Cut-Elimination: Finding Proofs or Counterexamples.
LPAR 2006: 135-149 |
| 12 | | Vincent Atassi,
Patrick Baillot,
Kazushige Terui:
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic
CoRR abs/cs/0603104: (2006) |
| 11 | | Max I. Kanovich,
Mitsuhiro Okada,
Kazushige Terui:
Intuitionistic phase semantics is almost classical.
Mathematical Structures in Computer Science 16(1): 67-86 (2006) |
| 10 | | Agata Ciabattoni,
Kazushige Terui:
Towards a Semantic Characterization of Cut-Elimination.
Studia Logica 82(1): 95-119 (2006) |
| 2005 |
|---|
| 9 | | Patrick Baillot,
Kazushige Terui:
A Feasible Algorithm for Typing in Elementary Affine Logic.
TLCA 2005: 55-70 |
| 2004 |
|---|
| 8 | | Kazushige Terui:
Proof Nets and Boolean Circuits.
LICS 2004: 182-191 |
| 7 | | Patrick Baillot,
Kazushige Terui:
Light Types for Polynomial Time Computation in Lambda-Calculus.
LICS 2004: 266-275 |
| 6 | | Patrick Baillot,
Kazushige Terui:
A feasible algorithm for typing in Elementary Affine Logic
CoRR abs/cs/0412028: (2004) |
| 5 | | Patrick Baillot,
Kazushige Terui:
Light types for polynomial time computation in lambda-calculus
CoRR cs.LO/0402059: (2004) |
| 4 | | Kazushige Terui:
Light Affine Set Theory: A Naive Set Theory of Polynomial Time.
Studia Logica 77(1): 9-40 (2004) |
| 2003 |
|---|
| 3 | | Harry G. Mairson,
Kazushige Terui:
On the Computational Complexity of Cut-Elimination in Linear Logic.
ICTCS 2003: 23-36 |
| 2001 |
|---|
| 2 |  | Kazushige Terui:
Light Affine Calculus and Polytime Strong Normalization.
LICS 2001 |
| 1999 |
|---|
| 1 | | Mitsuhiro Okada,
Kazushige Terui:
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.
J. Symb. Log. 64(2): 790-802 (1999) |
