4617 search results - page 214 / 924 » Automation of Diagrammatic Reasoning |
154
click to vote
CSL
2000
Springer
15 years 6 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 ...
152
click to vote
CSL
2002
Springer
15 years 6 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
157
click to vote
CSL
1999
Springer
15 years 6 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.