1101 search results - page 151 / 221 » Forcing in proof theory |
ENTCS
2002
15 years 12 days ago
2002
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
80
Voted
FOCM
2002
15 years 9 days ago
2002
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
95
Voted
DCG
1999
15 years 8 days ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
98
Voted
MOC
1998
15 years 8 days ago
1998
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
RML
2002
15 years 7 days ago
2002
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...