1 citations · 1 across the 4 of their papers we have counts for
4 papers
Conway and Doyle Can Divide by Three, But I Can't
Patrick Lutz
Conway and Doyle have claimed to be able to divide by three. We attempt to replicate their achievement and fail. In the process, we get tangled up in some shoes and socks and forge…
A theory satisfying a strong version of Tennenbaum's theorem
Patrick Lutz, James Walsh
We answer a question of Pakhomov by showing that there is a consistent, c.e. theory such that no theory which is definitionally equivalent to has a computable model. A key…
A Note on a Conjecture of Sacks: It is Harder to Embed Height Three Partial Orders than Height Two Partial Orders
Kojiro Higuchi, Patrick Lutz
A long-standing conjecture of Sacks states that it is provable in ZFC that every locally countable partial order of size continuum embeds into the Turing degrees. We show that this…
The Solecki Dichotomy and the Posner-Robinson Theorem are Almost Equivalent
Patrick Lutz
The Solecki dichotomy in descriptive set theory and the Posner-Robinson theorem in computability theory bear a superficial resemblance to each other and can sometimes be used to pr…