3353 search results - page 59 / 671 » Laver and set theory |
APAL
1998
14 years 9 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
TCS
2002
14 years 9 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
GC
2010
Springer
14 years 8 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
JSYML
2007
14 years 9 months ago
2007
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
ISCI
1998
14 years 9 months ago
1998
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...