default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazushige Terui
Person information
- affiliation: Kyoto University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c19]Kazushige Terui:
MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics. CSL 2018: 37:1-37:19- [i5]Kazushige Terui:
MacNeille completion and Buchholz' Omega rule for parameter-free second order logics. CoRR abs/1804.11066 (2018) - 2017
- [j13]Agata Ciabattoni
, Nikolaos Galatos, Kazushige Terui:
Algebraic proof theory: Hypersequents and hypercompletions. Ann. Pure Appl. Log. 168(3): 693-737 (2017) - 2016
- [c18]Ryota Akiyoshi, Kazushige Terui:
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule.. FSCD 2016: 5:1-5:15 - 2015
- [c17]Damiano Mazza, Kazushige Terui:
Parsimonious Types and Non-uniform Computation. ICALP (2) 2015: 350-361 - 2013
- [c16]Kazushige Terui:
Intersection Types for Normalization and Verification (Invited Talk). FSTTCS 2013: 41-42 - 2012
- [j12]Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui:
Algebraic proof theory for substructural logics: Cut-elimination and completions. Ann. Pure Appl. Log. 163(3): 266-290 (2012) - [c15]Kazushige Terui:
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus. RTA 2012: 323-338 - 2011
- [j11]Kazushige Terui:
Computational ludics. Theor. Comput. Sci. 412(20): 2048-2071 (2011) - [j10]Rostislav Horcík, Kazushige Terui:
Disjunction property and complexity of substructural logics. Theor. Comput. Sci. 412(31): 3992-4006 (2011) - [c14]Kazushige Terui:
Proof Theory and Algebra in Substructural Logics. TABLEAUX 2011: 20 - [p1]Michele Basaldella, Alexis Saurin, Kazushige Terui:
On the Meaning of Focalization. PRELUDE Project 2011: 78-87 - 2010
- [j9]Michele Basaldella, Kazushige Terui:
On the meaning of logical completeness. Log. Methods Comput. Sci. 6(4) (2010) - [c13]Michele Basaldella, Kazushige Terui:
Infinitary Completeness in Ludics. LICS 2010: 294-303 - [c12]Aloïs Brunel, Kazushige Terui:
Church => Scott = Ptime: an application of resource sensitive realizability. DICE 2010: 31-46 - [c11]Michele Basaldella, Alexis Saurin, Kazushige Terui:
From Focalization of Logic to the Logic of Focalization. MFPS 2010: 161-176
2000 – 2009
- 2009
- [j8]Patrick Baillot, Kazushige Terui:
Light types for polynomial time computation in lambda calculus. Inf. Comput. 207(1): 41-62 (2009) - [c10]Agata Ciabattoni, Lutz Straßburger, Kazushige Terui:
Expanding the Realm of Systematic Proof Theory. CSL 2009: 163-178 - [c9]Michele Basaldella, Kazushige Terui:
On the Meaning of Logical Completeness. TLCA 2009: 50-64 - 2008
- [c8]Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui:
From Axioms to Analytic Rules in Nonclassical Logics. LICS 2008: 229-240 - 2007
- [j7]Kazushige Terui:
Light affine lambda calculus and polynomial time strong normalization. Arch. Math. Log. 46(3-4): 253-280 (2007) - [j6]Kazushige Terui:
Which structural rules admit cut elimination? An algebraic criterion. J. Symb. Log. 72(3): 738-754 (2007) - [j5]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. Log. Methods Comput. Sci. 3(4) (2007) - [i4]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. CoRR abs/0710.1153 (2007) - 2006
- [j4]Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui:
Intuitionistic phase semantics is almost classical. Math. Struct. Comput. Sci. 16(1): 67-86 (2006) - [j3]Agata Ciabattoni, Kazushige Terui:
Towards a Semantic Characterization of Cut-Elimination. Stud Logica 82(1): 95-119 (2006) - [c7]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. CSL 2006: 150-166 - [c6]Agata Ciabattoni, Kazushige Terui:
Modular Cut-Elimination: Finding Proofs or Counterexamples. LPAR 2006: 135-149 - [i3]Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic. CoRR abs/cs/0603104 (2006) - 2005
- [c5]Patrick Baillot, Kazushige Terui:
A Feasible Algorithm for Typing in Elementary Affine Logic. TLCA 2005: 55-70 - 2004
- [j2]Kazushige Terui:
Light Affine Set Theory: A Naive Set Theory of Polynomial Time. Stud Logica 77(1): 9-40 (2004) - [c4]Kazushige Terui:
Proof Nets and Boolean Circuits. LICS 2004: 182-191 - [c3]Patrick Baillot, Kazushige Terui:
Light Types for Polynomial Time Computation in Lambda-Calculus. LICS 2004: 266-275 - [i2]Patrick Baillot, Kazushige Terui:
A feasible algorithm for typing in Elementary Affine Logic. CoRR abs/cs/0412028 (2004) - [i1]Patrick Baillot, Kazushige Terui:
Light types for polynomial time computation in lambda-calculus. CoRR cs.LO/0402059 (2004) - 2003
- [c2]Harry G. Mairson, Kazushige Terui:
On the Computational Complexity of Cut-Elimination in Linear Logic. ICTCS 2003: 23-36 - 2001
- [c1]Kazushige Terui:
Light Affine Calculus and Polytime Strong Normalization. LICS 2001: 209-220
1990 – 1999
- 1999
- [j1]Mitsuhiro Okada, Kazushige Terui:
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. J. Symb. Log. 64(2): 790-802 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
