69 search results - page 10 / 14 » mscs 2006 |
52
Voted
MSCS
2006
14 years 9 months ago
2006
We define a sequent calculus corresponding to the logic of strongly compact closed categories with biproducts. Based on this calculus, we define a proof-net syntax with ly normali...
MSCS
2006
14 years 9 months ago
2006
It is shown that for any 2-computably enumerable Turing degree l, any computably enumerable degree a, and any Turing degree s, if l = 0 , l < a, s 0 , and s is c.e. in a, then...
MSCS
2006
14 years 9 months ago
2006
Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
101
click to vote
MSCS
2000
14 years 9 months ago
2000
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
MSCS
2007
14 years 9 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...