347 search results - page 11 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
147
Voted
JSYML
2007
15 years 3 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
109
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...
135
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
129
Voted
NC
1998
15 years 5 months ago
1998
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
135
Voted
SIAMJO
2008
15 years 3 months ago
2008
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...