421 search results - page 22 / 85 » CSL |
CSL
2000
Springer
14 years 11 months ago
2000
Springer
Abstract. We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply ...
CSL
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped -calculus and G
CSL
1999
Springer
14 years 11 months ago
1999
Springer
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
DSN
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...