CIE
2010
Springer
14 years 2 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
14 years 2 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...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
CIE
2010
Springer
14 years 2 months ago
2010
Springer
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
CIE
2010
Springer
14 years 2 months ago
2010
Springer
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
A theorem of Besicovitch and Davies implies for Cantor space 2ω that each Σ1 1 (analytic) class of positive Hausdorff dimension contains a Π0 1 (closed) subclass of positive di...