6 citations · 26 across the 19 of their papers we have counts for
24 papers
The weakness of typicality
Eric P. Astor, Laurent Bienvenu, Damir Dzhafarov +4
Many statements studied in reverse mathematics can be seen as mathematical problems, formulated in terms of instances and solutions. We develop a framework of typicality encompassi…
Tennenbaum-like theorems for cohesive powers
David Gonzalez, Paul Shafer
We investigate the encoding ability of the cohesive power construction. We compute a graph where the cohesive power of by any $Δ_2…
Intuitionism and computing with partial information
Hristo Ganchev, Paul Shafer, Theodore A. Slaman +2
There exist initial segments of both the Dyment lattice and the Dyment-Muchnik lattice that yield Brouwer algebras modeling exactly the intuitionistic propositional calculus. For t…
Bounded Ramsey's theorem for triples in computability theory
Ludovic Patey, Paul Shafer
We study a restriction of Ramsey's theorem for 2-coloring of triples, in which homogeneous sets for color~1 are of bounded size (). We prove that the computationa…
Metric fixed point theory and partial impredicativity
David Fernández-Duque, Paul Shafer, Henry Towsner +1
We show that the Priess-Crampe & Ribenboim fixed point theorem is provable in . Furthermore, we show that Caristi's fixed point theorem for both Baire and Borel fun…
Effective powers of over cohesive sets and infinite sets without cohesive subsets
Paul Shafer
A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let , , and denote the respective order-types of the na…