22 citations · 26 across the 30 of their papers we have counts for
1 paper · 2 filters
Yasha Savelyev
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of Gödel. A typical stably computably enumerable set is…