BSL 2005 | Sciweavers

13

BSL
2005

70views more BSL 2005»

13 years 4 months ago

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...

Stephen G. Simpson

claim paper

Read More »

8

click to vote

BSL
2005

56views more BSL 2005»

The role of true finiteness in the admissible recursively enumerable degrees

13 years 4 months ago

Download ecommons.library.cornell.edu

Noam Greenberg

claim paper

Read More »

8

click to vote

BSL
2005

53views more BSL 2005»

Partition Theorems and Computability Theory

13 years 4 months ago

Download math.boisestate.edu

Joseph R. Mileti

claim paper

Read More »

16

click to vote

BSL
2005

74views more BSL 2005»

Turing computations on ordinals

13 years 4 months ago

Download www.math.uni-bonn.de

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 ...

Peter Koepke

claim paper

Read More »

12

click to vote

BSL
2005

106views more BSL 2005»

Compactness and independence in non first order frameworks

13 years 4 months ago

Download math.univ-lyon1.fr

This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...

Itay Ben-Yaacov

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers