1410 search results - page 131 / 282 » Proving theorems by reuse |
146
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
199
Voted
AISC
2000
Springer
15 years 10 months ago
2000
Springer
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
132
click to vote
ESSLLI
1999
Springer
15 years 10 months ago
1999
Springer
In this paper I take a dynamic view in the spirit of the update semantics by Veltman (1996) on the first–order model construction procedure presented by Manthey and Bry (1988)....
189
click to vote
HYBRID
1998
Springer
15 years 10 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
181
click to vote
TABLEAUX
1997
Springer
15 years 10 months ago
1997
Springer
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...