| [Ter18] |
Kazushige Terui.
MacNeille completion and Buchholz' Omega rule for parameter-free second order logics (revised version). Submitted. [.pdf] |
| [MT16] |
Kei Matsumoto and Kazushige Terui.
Coherence spaces for real functions and operators. Submitted. [.pdf] |
| [Ter14a] |
Kazushige Terui.
Open problems: Brouwer's fixed point theorem and Cantor's naive set theory in substructural and fuzzy logics. Note. [.pdf] |
| [Ter14b] |
Kazushige Terui.
A flaw in R.B. White's article "The consistency of the axiom of comprehension in the infinite-valued predicate logic of Lukasiewicz." Note. [.pdf] |
| [BK14] |
Paolo Baldi and Kazushige Terui.
Densification of FL chains via residuated frames. Algebra Universalis, 75 (2): 169-195, 2016. [http | .pdf] |
| [Ter12] |
Kazushige Terui.
Semantic evaluation, intersection types and complexity of simply typed lambda calculus. In Proceedings of RTA'12 pp. 323-338, 2012 (best paper award). [ bib | .pdf | Abstract ] |
| [CGT12] |
Agata Ciabattoni, Nikolaos Galatos, and Kazushige Terui.
Algebraic proof theory for substructural logics: Cut-elimination and completions. Ann. Pure Appl. Logic, Vol. 163, No. 3, pp. 266-290, 2012. [ bib | http | .pdf | Abstract ] |
| [Ter11] |
Kazushige Terui.
Computational ludics. Theor. Comput. Sci., Vol. 412, No. 20, pp. 2048-2071, 2011. [ bib | http | .pdf | Abstract ] |
| [HT11] |
Rostislav Horcík and Kazushige Terui.
Disjunction property and complexity of substructural logics. Theor. Comput. Sci., Vol. 412, No. 31, pp. 3992-4006, 2011. [ bib | http | .pdf | Abstract ] |
| [CGT11] |
Agata Ciabattoni, Nikolaos Galatos, and Kazushige Terui.
Macneille completions of FL-algebras. Algebra Universalis, Vol. 66, No. 4, pp. 405-420, 2011. [ bib | http | .pdf | Abstract ] |
| [BT10c] |
Aloïs Brunel and Kazushige Terui.
Church => Scott = Ptime: an application of resource sensitive realizability. In DICE, pp. 31-46, 2010. [ bib | http | http | Abstract ] |
| [BT10a] |
Michele Basaldella and Kazushige Terui.
Infinitary completeness in ludics. In LICS, pp. 294-303, 2010. [ bib | http | .pdf | Abstract ] |
| [BT10b] |
Michele Basaldella and Kazushige Terui.
On the meaning of logical completeness. Logical Methods in Computer Science, Vol. 6, No. 4, 2010. [ bib | http | http | Abstract ] |
| [ACT09] |
Agata Ciabattoni, Lutz Straßburger and Kazushige Terui.
Expanding the realm of systematic proof theory. In Proceedings of CSL'09, 2009. [ bib | .pdf | Abstract ] |
| [BT09b] |
Michele Basaldella and Kazushige Terui.
On the meaning of logical completeness. In Proceedings of TLCA'09, pp. 50-64, 2009. [ bib | http | .pdf | Abstract ] |
| [BT09a] |
Patrick Baillot and Kazushige Terui.
Light types for polynomial time computation in lambda calculus. Information and Computation, Vol. 207, No. 1, pp. 41-62, 2009. [ bib | .pdf | Abstract ] |
| [CGT08] |
Agata Ciabattoni, Nikolaos Galatos, and Kazushige Terui.
From axioms to analytic rules in nonclassical logics. In Proceedings of LICS'08, pp. 229-240, 2008. [ bib | http | .pdf | Abstract ] |
| [ABT07] |
Vincent Atassi, Patrick Baillot, and Kazushige Terui.
Verification of ptime reducibility for system F terms: Type inference in dual light affine logic. Logical Methods in Computer Science, Vol. 3, No. 4, 2007. [ bib | http | Abstract ] |
| [Ter07a] |
Kazushige Terui.
Light affine lambda calculus and polynomial time strong normalization. Archive for Mathematical Logic, Vol. 46, No. 3-4, pp. 253-280, 2007. [ bib | http | .pdf | Abstract ] |
| [Ter07b] |
Kazushige Terui.
Which structural rules admit cut elimination? an algebraic criterion. Journal of Symbolic Logic, Vol. 72, No. 3, pp. 738-754, 2007. [ bib | http | .pdf | Abstract ] |
| [CT06b] |
Agata Ciabattoni and Kazushige Terui.
Towards a semantic characterization of cut-elimination. Studia Logica, Vol. 82, No. 1, pp. 95-119, 2006. Corrigenda: http://www.kurims.kyoto-u.ac.jp/~terui/corrigendaSL.pdf. [ bib | http | .pdf | Abstract ] |
| [CT06a] |
Agata Ciabattoni and Kazushige Terui.
Modular cut-elimination: Finding proofs or counterexamples. In Proceedings of LPAR'06, pp. 135-149. LNAI 4246, 2006. [ bib | http | .pdf | Abstract ] |
| [ABT06] |
Vincent Atassi, Patrick Baillot, and Kazushige Terui.
Verification of ptime reducibility for system F terms via dual light affine logic. In Proceedings of CSL'06, pp. 150-166, 2006. See [ABT07] for the journal version. [ bib | http | Abstract ] |
| [KOT06] |
Max I. Kanovich, Mitsuhiro Okada, and Kazushige Terui.
Intuitionistic phase semantics is almost classical. Mathematical Structures in Computer Science, Vol. 16, pp. 1-20, 2006. [ bib | http | .pdf | Abstract ] |
| [BT05] |
Patrick Baillot and Kazushige Terui.
A feasible algorithm for typing in elementary affine logic. In Proceedings of TLCA'05, pp. 55-70. LNCS 3461, 2005. [ bib | http | .pdf | Abstract ] |
| [Ter04a] |
Kazushige Terui.
Light affine set theory: A naive set theory of polynomial time. Studia Logica, Vol. 77, No. 1, pp. 9-40, 2004. [ bib | http | .pdf | Abstract ] |
| [BT04] |
Patrick Baillot and Kazushige Terui.
Light types for polynomial time computation in lambda-calculus. In Proceedings of LICS'04, pp. 266-275, 2004. See [BT08] for the journal version. [ bib | http | Abstract ] |
| [Ter04b] |
Kazushige Terui.
Proof nets and boolean circuits. In Proceedings of LICS'04, pp. 182-191, 2004. [ bib | http | .pdf | Abstract ] |
| [MT03] |
Harry G. Mairson and Kazushige Terui.
On the computational complexity of cut-elimination in linear logic. In Proceedings of ICTCS'03, pp. 23-36. LNCS 2841, 2003. [ bib | .pdf | Abstract ] |
| [Ter02] |
Kazushige Terui.
Light Logic and Polynomial Time Computation. PhD thesis, Keio University, March 2002. [ bib | .pdf ] |
| [Ter01] |
Kazushige Terui.
Light affine lambda calculus and polytime strong normalization. In Proceedings of LICS'01, 2001. See [Ter07a] for the journal version. [ bib | Abstract ] |
| [OT99] |
Mitsuhiro Okada and Kazushige Terui.
The finite model property for various fragments of intuitionistic linear logic. Journal of Symbolic Logic, Vol. 64, No. 2, pp. 790-802, 1999. [ bib | http | Abstract ] |
| [Ter99] |
Kazushige Terui.
Labelled tableau calculi generating simple models for substructural logics, ILLC Research Report PP-1999-04, University of Amsterdam, 1999. [ bib | .pdf | Abstract ] |
| [OT98] |
Mitsuhiro Okada and Kazushige Terui.
Completeness proofs for linear logic based on the proof search method (preliminary report). In J. Garrigue, editor, RIMS Koukyuroku 1023: Type theory and its applications to computer systems, pp. 57-75. Research Institute for Mathematical Sciences, Kyoto University, 1998. [ bib | .pdf | http | Abstract ] |
| [Ter98] |
Kazushige Terui.
Anaphoric linking at run time: A type-logical account of discourse representation. ILLC Research Report LP-1998-17, University of Amsterdam, 1998. [ bib | .pdf | Abstract ] |
| [OT97] |
Mitsuhiro Okada and Kazushige Terui.
Semantic characterizations for reachability and trace equivalence in a linear logic-based process calculus. In T. Arai, editor, RIMS Koukyuroku 976: Symposium on Proof Theory and Ordinals, pp. 146-168. Research Institute for Mathematical Sciences, Kyoto University, 1997. [ bib | http | .pdf | Abstract ] |
This file has been generated by bibtex2html 1.79