Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Kazushige Terui"'
Autor:
Aloïs Brunel, Kazushige Terui
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 23, Iss Proc. DICE 2010, Pp 31-46 (2010)
We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type `Church,' while the Scott encodings (pure
Externí odkaz:
https://doaj.org/article/457c438561d740f4a9317a5f3e641939
Autor:
Michele Basaldella, Kazushige Terui
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 4 (2010)
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two disciplines.
Externí odkaz:
https://doaj.org/article/bd48c62b3d154002948d5cf63c5c62e1
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 4 (2007)
In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial time by beta
Externí odkaz:
https://doaj.org/article/6730378e235248fd8539a854b15326f9
Autor:
Nikolaos Galatos, Kazushige Terui
This volume is dedicated to Hiroakira Ono life's work on substructural logics. Chapters, written by well-established academics, cover topics related to universal algebra, algebraic logic and the Full Lambek calculus; the book includes a short biograp
Publikováno v:
Annals of Pure and Applied Logic. 168:693-737
We continue our program of establishing connections between proof-theoretic and order-algebraic properties in the setting of substructural logics and residuated lattices. Extending our previous work that connects a strong form of cut-admissibility in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3eb4dd88ad8050c44a7f05c847f379f2
https://doi.org/10.1016/j.apal.2016.10.012
https://doi.org/10.1016/j.apal.2016.10.012
Autor:
Kazushige Terui, Paolo Baldi
Publikováno v:
Algebra universalis. 75:169-195
We introduce a systematic method for densification, i.e., embedding a given chain into a dense one preserving certain identities, in the framework of FL algebras (pointed residuated lattices). Our method, based on residuated frames, offers a uniform
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05a7e2c5ce5418473b2946cca5c01485
https://doi.org/10.1007/s00012-016-0372-5
https://doi.org/10.1007/s00012-016-0372-5
Autor:
Kazushige Terui
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 242:2-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee1d88a4a0933a0cc18284cc509143c5
https://doi.org/10.4204/eptcs.242.2
https://doi.org/10.4204/eptcs.242.2
Publikováno v:
Algebra universalis. 66:405-420
We show that a large number of equations are preserved by Dedekind-MacNeille completions when applied to subdirectly irreducible FL-algebras/residuated lattices. These equations are identified in a systematic way, based on proof-theoretic ideas and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fa0b44f31e33fccf59479578c340a9d
https://doi.org/10.1007/s00012-011-0160-1
https://doi.org/10.1007/s00012-011-0160-1
Autor:
Kazushige Terui, Rostislav Horík
Publikováno v:
Theoretical Computer Science. 412:3992-4006
We systematically identify a large class of substructural logics that satisfy the disjunction property (DP), and show that every consistent substructural logic with the DP is PSPACE-hard. Our results are obtained by using algebraic techniques. PSPACE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d96972e0cd1d70e6fd1f11cda2b7b2f5
https://doi.org/10.1016/j.tcs.2011.04.004
https://doi.org/10.1016/j.tcs.2011.04.004
Autor:
Kazushige Terui
Publikováno v:
Theoretical Computer Science. 412:2048-2071
We reformulate the theory of ludics introduced by J.-Y. Girard from a computational point of view. We introduce a handy term syntax for designs, the main objects of ludics. Our syntax also incorporates explicit cuts for attaining computational expres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::687449ddf425dedaa61482bc79b37091
https://doi.org/10.1016/j.tcs.2010.12.026
https://doi.org/10.1016/j.tcs.2010.12.026