2 papers
math.LO2005
The modal logic of forcing
Joel David Hamkins, Benedikt Loewe
What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are natu…
math.LO2005
The halting problem is decidable on a set of asymptotic probability one
Joel David Hamkins, Alexei Miasnikov
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptoti…