4 citations · 12 across the 19 of their papers we have counts for
1 paper · 1 filter
Guillermo Badia, Petr Cintula, Petr Hajek +1
In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well know…