1410 search results - page 130 / 282 » Proving theorems by reuse |
174
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
145
click to vote
ER
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardin...
146
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
153
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
132
click to vote
FSE
2010
Springer
15 years 10 months ago
2010
Springer
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...