Kazushige Terui

932 total citations
27 papers, 347 citations indexed

About

Kazushige Terui is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Kazushige Terui has authored 27 papers receiving a total of 347 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Artificial Intelligence, 24 papers in Computational Theory and Mathematics and 2 papers in Electrical and Electronic Engineering. Recurrent topics in Kazushige Terui's work include Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (21 papers) and Formal Methods in Verification (12 papers). Kazushige Terui is often cited by papers focused on Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (21 papers) and Formal Methods in Verification (12 papers). Kazushige Terui collaborates with scholars based in Japan, Austria and France. Kazushige Terui's co-authors include Agata Ciabattoni, Nikolaos Galatos, Mitsuhiro Okada, Patrick Baillot, Paolo Baldi, Max Kanovich, Mitsuhiro Okada and Alexis Saurin and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Symbolic Logic.

In The Last Decade

Kazushige Terui

25 papers receiving 324 citations

Peers

Kazushige Terui
Kazushige Terui
Citations per year, relative to Kazushige Terui Kazushige Terui (= 1×) peers Symeon Bozapalidis

Countries citing papers authored by Kazushige Terui

Since Specialization
Citations

This map shows the geographic impact of Kazushige Terui's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kazushige Terui with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kazushige Terui more than expected).

Fields of papers citing papers by Kazushige Terui

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kazushige Terui. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kazushige Terui. The network helps show where Kazushige Terui may publish in the future.

Co-authorship network of co-authors of Kazushige Terui

This figure shows the co-authorship network connecting the top 25 collaborators of Kazushige Terui. A scholar is included among the top collaborators of Kazushige Terui based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kazushige Terui. Kazushige Terui is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ciabattoni, Agata, Nikolaos Galatos, & Kazushige Terui. (2016). Algebraic proof theory: Hypersequents and hypercompletions. Annals of Pure and Applied Logic. 168(3). 693–737. 10 indexed citations
2.
Ciabattoni, Agata, Nikolaos Galatos, & Kazushige Terui. (2011). Algebraic proof theory for substructural logics: Cut-elimination and completions. Annals of Pure and Applied Logic. 163(3). 266–290. 35 indexed citations
3.
Terui, Kazushige, et al.. (2011). Disjunction property and complexity of substructural logics. Theoretical Computer Science. 412(31). 3992–4006. 12 indexed citations
4.
Terui, Kazushige. (2010). Computational ludics. Theoretical Computer Science. 412(20). 2048–2071. 6 indexed citations
5.
Saurin, Alexis, et al.. (2010). From Focalization of Logic to the Logic of Focalization. Electronic Notes in Theoretical Computer Science. 265. 161–176.
6.
Terui, Kazushige, et al.. (2010). Infinitary Completeness in Ludics. 163. 294–303. 1 indexed citations
7.
Baillot, Patrick & Kazushige Terui. (2008). Light types for polynomial time computation in lambda calculus. Information and Computation. 207(1). 41–62. 20 indexed citations
8.
Ciabattoni, Agata, Nikolaos Galatos, & Kazushige Terui. (2008). From Axioms to Analytic Rules in Nonclassical Logics. 229–240. 62 indexed citations
9.
Terui, Kazushige. (2007). Which structural rules admit cut elimination? An algebraic criterion. Journal of Symbolic Logic. 72(3). 738–754. 11 indexed citations
10.
Ciabattoni, Agata & Kazushige Terui. (2006). Towards a Semantic Characterization of Cut-Elimination. Studia Logica. 82(1). 95–119. 17 indexed citations
11.
Kanovich, Max, Mitsuhiro Okada, & Kazushige Terui. (2006). Intuitionistic phase semantics is almost classical. Mathematical Structures in Computer Science. 16(1). 67–86. 3 indexed citations
12.
Terui, Kazushige. (2004). Proof nets and Boolean circuits. 182–191. 9 indexed citations
13.
Terui, Kazushige. (2004). Light Affine Set Theory: A Naive Set Theory of Polynomial Time. Studia Logica. 77(1). 9–40. 23 indexed citations
14.
Terui, Kazushige. (2004). Proof nets and Boolean circuits. 182–191. 6 indexed citations
15.
Terui, Kazushige. (2004). Labelled Tableau Calculi Generating Simple Models for Substructural Logics.
16.
Baillot, Patrick & Kazushige Terui. (2004). Light types for polynomial time computation in lambda-calculus. arXiv (Cornell University). 11. 266–275. 1 indexed citations
17.
Terui, Kazushige. (2002). Light affine lambda calculus and polytime strong normalization. 209–220. 19 indexed citations
18.
Terui, Kazushige. (2001). Light Affine Calculus and Polytime Strong Normalization.. 209–220. 3 indexed citations
19.
Okada, Mitsuhiro & Kazushige Terui. (1999). The finite model property for various fragments of intuitionistic linear logic. Journal of Symbolic Logic. 64(2). 790–802. 52 indexed citations
20.
Okada, Mitsuhiro & Kazushige Terui. (1998). Completeness Proofs for Linear Logic Based on the Proof Search Method(Preliminary Report)(Type Theory and its Applications to Computer Systems). Kyoto University Research Information Repository (Kyoto University). 1023. 57–75. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026