Sciweavers

Share
COMBINATORICA
2011
7 years 11 months ago
Binary subtrees with few labeled paths
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 ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
NDJFL
2010
8 years 6 months ago
Subclasses of the Weakly Random Reals
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...
Johanna N. Y. Franklin
CORR
2010
Springer
81views Education» more  CORR 2010»
8 years 6 months ago
Enumerating randoms
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...
Bjørn Kjos-Hanssen, Frank Stephan, Jason Te...
NDJFL
2000
97views more  NDJFL 2000»
8 years 11 months ago
Neo-Fregean Foundations for Real Analysis: Some Reflections on Frege's Constraint
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...
Crispin Wright
APAL
2007
88views more  APAL 2007»
9 years 14 hour ago
Randomness and the linear degrees of computability
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 ...
Andrew E. M. Lewis, George Barmpalias
TYPES
2000
Springer
9 years 3 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
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...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
TPHOL
2007
IEEE
9 years 6 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
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...
John Harrison
CIE
2009
Springer
9 years 6 months ago
Numberings and Randomness
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...
Paul Brodhead, Bjørn Kjos-Hanssen
books