CSL
2005
Springer
14 years 6 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
CSL
2005
Springer
14 years 6 months ago
2005
Springer
CSL
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. Focusing is traditionally seen as a means of reducing inessential nondeterminism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In thi...
CSL
2005
Springer
14 years 6 months ago
2005
Springer
CSL
2005
Springer
14 years 6 months ago
2005
Springer
CSL
2005
Springer
14 years 6 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
CSL
2005
Springer
14 years 6 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
CSL
2005
Springer
14 years 6 months ago
2005
Springer
CSL
2005
Springer
14 years 6 months ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
CSL
2005
Springer
14 years 6 months ago
2005
Springer
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...