COMBINATORICA
2011
13 years 7 days ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
NDJFL
2010
13 years 7 months ago
2010
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
NDJFL
2000
14 years 6 days ago
2000
now of a number of ways of developing Real Analysis on a basis of abstraction principles and second-order logic. One, outlined by Shapiro in his contribution to this volume, mimic...
APAL
2007
14 years 17 days ago
2007
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
TYPES
2000
Springer
14 years 4 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
TPHOL
2007
IEEE
14 years 6 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...