37 search results - page 5 / 8 » bsl 2008 |
BSL
2005
13 years 7 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
BSL
2000
13 years 7 months ago
2000
In the spirit of a theorem of Wood [21], we give necessary and sufficient conditions for a family of germs of analytic hypersurfaces in a smooth projective toric variety X to be i...
BSL
2008
13 years 7 months ago
2008
The last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics. The paper discus...
BSL
2008
13 years 7 months ago
2008
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
BSL
2006
13 years 7 months ago
2006
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard ari...