13306 search results - page 399 / 2662 » Theoretical Computer Science |
130
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
158
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
132
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Let I be a finite set of integers and F be a finite set of maps of the form n → ki n + i with integer coefficients. For an integer base k ≥ 2, we study the k-recognizability ...
161
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We recently introduced an extensional model of the pure λcalculus living in a cartesian closed category of sets and relations. In this paper, we provide sufficient condi...
170
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...