|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 10 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui |
Algebraic proof theory for substructural logics: Cut-elimination and completions.  |
Ann. Pure Appl. Logic  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rostislav Horcík, Kazushige Terui |
Disjunction property and complexity of substructural logics.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Computational ludics.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Basaldella, Alexis Saurin, Kazushige Terui |
On the Meaning of Focalization.  |
PRELUDE Project  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Proof Theory and Algebra in Substructural Logics.  |
TABLEAUX  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Basaldella, Alexis Saurin, Kazushige Terui |
From Focalization of Logic to the Logic of Focalization.  |
Electr. Notes Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aloïs Brunel, Kazushige Terui |
Church => Scott = Ptime: an application of resource sensitive realizability  |
DICE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Basaldella, Kazushige Terui |
On the meaning of logical completeness  |
Logical Methods in Computer Science  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Basaldella, Kazushige Terui |
Infinitary Completeness in Ludics.  |
LICS  |
2010 |
DBLP DOI BibTeX RDF |
ludics, completeness, linear logic, recursive types, coinduction |
| 1 | Patrick Baillot, Kazushige Terui |
Light types for polynomial time computation in lambda calculus.  |
Inf. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Basaldella, Kazushige Terui |
On the Meaning of Logical Completeness.  |
TLCA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Agata Ciabattoni, Lutz Straßburger, Kazushige Terui |
Expanding the Realm of Systematic Proof Theory.  |
CSL  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui |
From Axioms to Analytic Rules in Nonclassical Logics.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
nonclassical logics, hypersequent calculi, semantic cut-elimination, sequent calculi |
| 1 | Kazushige Terui |
Which structural rules admit cut elimination? An algebraic criterion.  |
J. Symb. Log.  |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Kazushige Terui |
Light affine lambda calculus and polynomial time strong normalization.  |
Arch. Math. Log.  |
2007 |
DBLP DOI BibTeX RDF |
Light logics, Lambda calculus, Polynomial time |
| 1 | Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui |
Intuitionistic phase semantics is almost classical.  |
Mathematical Structures in Computer Science  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Agata Ciabattoni, Kazushige Terui |
Towards a Semantic Characterization of Cut-Elimination.  |
Studia Logica  |
2006 |
DBLP DOI BibTeX RDF |
nonclassical logicss, phase semantics, sequent calculus, cut-elimination, substructural logics |
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Agata Ciabattoni, Kazushige Terui |
Modular Cut-Elimination: Finding Proofs or Counterexamples.  |
LPAR  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.  |
CSL  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
A Feasible Algorithm for Typing in Elementary Affine Logic.  |
TLCA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Light Affine Set Theory: A Naive Set Theory of Polynomial Time.  |
Studia Logica  |
2004 |
DBLP DOI BibTeX RDF |
naive set theory, light logic, linear logic, polynomial time, substructural logics |
| 1 | Patrick Baillot, Kazushige Terui |
Light types for polynomial time computation in lambda-calculus  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
A feasible algorithm for typing in Elementary Affine Logic  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
Light Types for Polynomial Time Computation in Lambda-Calculus.  |
LICS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Proof Nets and Boolean Circuits.  |
LICS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry G. Mairson, Kazushige Terui |
On the Computational Complexity of Cut-Elimination in Linear Logic.  |
ICTCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Light Affine Calculus and Polytime Strong Normalization.  |
LICS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsuhiro Okada, Kazushige Terui |
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.  |
J. Symb. Log.  |
1999 |
DBLP BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|