27 search results - page 2 / 6 » cie 2010 |
CIE
2010
Springer
12 years 12 months ago
2010
Springer
CIE
2010
Springer
13 years 9 months ago
2010
Springer
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
CIE
2010
Springer
12 years 12 months ago
2010
Springer
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
CIE
2010
Springer
13 years 9 months ago
2010
Springer
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
CIE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to t...