Kazushige Terui

38 papers A* 5B 7Journal 18Unranked 7
YearRankTypeTitle / Venue / Authors
2018 B conf
MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics.
CSL
Kazushige Terui
2018 J jnl
MacNeille completion and Buchholz' Omega rule for parameter-free second order logics.
CoRR
Kazushige Terui
2017 J jnl
Algebraic proof theory: Hypersequents and hypercompletions.
Ann. Pure Appl. Log.
Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui
2016 B conf
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule..
FSCD
Ryota Akiyoshi, Kazushige Terui
2015 — conf
Parsimonious Types and Non-uniform Computation.
ICALP (2)
Damiano Mazza, Kazushige Terui
2013 — conf
Intersection Types for Normalization and Verification (Invited Talk).
FSTTCS
Kazushige Terui
2012 J jnl
Algebraic proof theory for substructural logics: Cut-elimination and completions.
Ann. Pure Appl. Log.
Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui
2012 — conf
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus.
RTA
Kazushige Terui
2011 J jnl
Computational ludics.
Theor. Comput. Sci.
Kazushige Terui
2011 J jnl
Disjunction property and complexity of substructural logics.
Theor. Comput. Sci.
Rostislav Horcík, Kazushige Terui
2011 — ch.
On the Meaning of Focalization.
PRELUDE Project
Michele Basaldella, Alexis Saurin, Kazushige Terui
2011 B conf
Proof Theory and Algebra in Substructural Logics.
TABLEAUX
Kazushige Terui
2010 — conf
Church => Scott = Ptime: an application of resource sensitive realizability
DICE
Aloïs Brunel, Kazushige Terui
2010 B conf
From Focalization of Logic to the Logic of Focalization.
MFPS
Michele Basaldella, Alexis Saurin, Kazushige Terui
2010 A* conf
Infinitary Completeness in Ludics.
LICS
Michele Basaldella, Kazushige Terui
2010 J jnl
On the meaning of logical completeness
Log. Methods Comput. Sci.
Michele Basaldella, Kazushige Terui
2009 B conf
Expanding the Realm of Systematic Proof Theory.
CSL
Agata Ciabattoni, Lutz Straßburger, Kazushige Terui
2009 J jnl
Light types for polynomial time computation in lambda calculus.
Inf. Comput.
Patrick Baillot, Kazushige Terui
2009 — conf
On the Meaning of Logical Completeness.
TLCA
Michele Basaldella, Kazushige Terui
2008 A* conf
From Axioms to Analytic Rules in Nonclassical Logics.
LICS
Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui
2007 J jnl
Light affine lambda calculus and polynomial time strong normalization.
Arch. Math. Log.
Kazushige Terui
2007 J jnl
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
CoRR
Vincent Atassi, Patrick Baillot, Kazushige Terui
2007 J jnl
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.
Log. Methods Comput. Sci.
Vincent Atassi, Patrick Baillot, Kazushige Terui
2007 J jnl
Which structural rules admit cut elimination? An algebraic criterion.
J. Symb. Log.
Kazushige Terui
2006 J jnl
Intuitionistic phase semantics is almost classical.
Math. Struct. Comput. Sci.
Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui
2006 B conf
Modular Cut-Elimination: Finding Proofs or Counterexamples.
LPAR
Agata Ciabattoni, Kazushige Terui
2006 J jnl
Towards a Semantic Characterization of Cut-Elimination.
Stud Logica
Agata Ciabattoni, Kazushige Terui
2006 B conf
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.
CSL
Vincent Atassi, Patrick Baillot, Kazushige Terui
2006 J jnl
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic
CoRR
Vincent Atassi, Patrick Baillot, Kazushige Terui
2005 — conf
A Feasible Algorithm for Typing in Elementary Affine Logic.
TLCA
Patrick Baillot, Kazushige Terui
2004 J jnl
A feasible algorithm for typing in Elementary Affine Logic
CoRR
Patrick Baillot, Kazushige Terui
2004 J jnl
Light Affine Set Theory: A Naive Set Theory of Polynomial Time.
Stud Logica
Kazushige Terui
2004 A* conf
Light Types for Polynomial Time Computation in Lambda-Calculus.
LICS
Patrick Baillot, Kazushige Terui
2004 J jnl
Light types for polynomial time computation in lambda-calculus
CoRR
Patrick Baillot, Kazushige Terui
2004 A* conf
Proof Nets and Boolean Circuits.
LICS
Kazushige Terui
2003 — conf
On the Computational Complexity of Cut-Elimination in Linear Logic.
ICTCS
Harry G. Mairson, Kazushige Terui
2001 A* conf
Light Affine Calculus and Polytime Strong Normalization.
LICS
Kazushige Terui
1999 J jnl
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.
J. Symb. Log.
Mitsuhiro Okada, Kazushige Terui