Sciweavers

APAL
2005
67views more  APAL 2005»
13 years 4 months ago
The minimal e-degree problem in fragments of Peano arithmetic
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of 2 induction, there is ...
Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper,...