JSYML
2007
13 years 4 months ago
2007
We give four examples of theories in which Kreisel’s Conjecture is false: (1) the theory PA(-) obtained by adding a function symbol minus, ‘−’, to the language of PA, and t...
IANDC
2007
13 years 4 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
MLQ
2006
13 years 4 months ago
2006
We prove that the sharply bounded arithmetic T0 2 in a language containing the function symbol x
AISC
2004
Springer
13 years 8 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...