3 papers
math.LO2018
Dense computability, upper cones, and minimal pairs
Eric P. Astor, Denis R. Hirschfeldt, Carl G. Jockusch
This paper concerns algorithms that give correct answers with (asymptotic) density . A dense description of a function is a partial function on such that $\…
math.LO2017
The computational content of intrinsic density
Eric P. Astor
In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We…
math.LO2016
The uniform content of partial and linear orders
Eric P. Astor, Damir D. Dzhafarov, Reed Solomon +1
The principle asserts that every linear order on has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature…