13306 search results - page 394 / 2662 » Theoretical Computer Science |
179
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
147
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...
178
click to vote
RTA
2007
Springer
16 years 29 days ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
197
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
214
click to vote
TLCA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...